./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:35:32,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:35:32,864 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:35:32,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:35:32,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:35:32,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:35:32,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:35:32,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:35:32,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:35:32,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:35:32,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:35:32,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:35:32,938 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:35:32,941 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:35:32,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:35:32,942 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:35:32,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:35:32,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:35:32,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:35:32,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:35:32,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:35:32,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:35:32,945 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:35:32,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:35:32,946 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:35:32,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:35:32,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:35:32,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:35:32,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:35:32,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:35:32,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:35:32,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:35:32,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:35:32,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:35:32,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:35:32,954 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:35:32,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:35:32,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:35:32,955 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:35:32,955 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 [2023-11-19 07:35:33,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:35:33,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:35:33,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:35:33,373 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:35:33,374 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:35:33,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-11-19 07:35:36,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:35:37,054 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:35:37,055 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-11-19 07:35:37,071 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/data/86acd4c4c/1005061de3b649f6a94413472020bd6a/FLAG6957798ed [2023-11-19 07:35:37,099 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/data/86acd4c4c/1005061de3b649f6a94413472020bd6a [2023-11-19 07:35:37,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:35:37,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:35:37,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:37,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:35:37,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:35:37,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e952118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37, skipping insertion in model container [2023-11-19 07:35:37,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,176 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:35:37,367 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2023-11-19 07:35:37,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:37,432 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:35:37,448 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2023-11-19 07:35:37,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:37,496 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:35:37,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37 WrapperNode [2023-11-19 07:35:37,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:37,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:37,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:35:37,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:35:37,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,572 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2023-11-19 07:35:37,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:37,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:35:37,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:35:37,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:35:37,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:35:37,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:35:37,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:35:37,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:35:37,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (1/1) ... [2023-11-19 07:35:37,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:35:37,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:37,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:35:37,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:35:37,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:35:37,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-19 07:35:37,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-19 07:35:37,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:35:37,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:35:37,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:35:37,854 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:35:37,857 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:35:38,389 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:35:38,407 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:35:38,409 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:35:38,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:38 BoogieIcfgContainer [2023-11-19 07:35:38,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:35:38,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:35:38,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:35:38,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:35:38,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:35:37" (1/3) ... [2023-11-19 07:35:38,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a6de52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:38, skipping insertion in model container [2023-11-19 07:35:38,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:37" (2/3) ... [2023-11-19 07:35:38,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a6de52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:38, skipping insertion in model container [2023-11-19 07:35:38,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:38" (3/3) ... [2023-11-19 07:35:38,436 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-11-19 07:35:38,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:35:38,459 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:35:38,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:35:38,525 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f62b983, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:35:38,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:35:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-19 07:35:38,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-19 07:35:38,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:38,551 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:38,552 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:38,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash 159776338, now seen corresponding path program 1 times [2023-11-19 07:35:38,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:38,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900295335] [2023-11-19 07:35:38,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:38,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:38,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:38,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:38,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:38,886 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:38,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:38,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900295335] [2023-11-19 07:35:38,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900295335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:38,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:35:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797289046] [2023-11-19 07:35:38,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:38,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:35:38,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:38,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:35:38,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:35:38,946 INFO L87 Difference]: Start difference. First operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-19 07:35:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:38,994 INFO L93 Difference]: Finished difference Result 91 states and 138 transitions. [2023-11-19 07:35:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:35:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-11-19 07:35:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:39,010 INFO L225 Difference]: With dead ends: 91 [2023-11-19 07:35:39,011 INFO L226 Difference]: Without dead ends: 43 [2023-11-19 07:35:39,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:35:39,026 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:39,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:35:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-19 07:35:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-19 07:35:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-19 07:35:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2023-11-19 07:35:39,099 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 58 [2023-11-19 07:35:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:39,100 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2023-11-19 07:35:39,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-19 07:35:39,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2023-11-19 07:35:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-19 07:35:39,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:39,105 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:39,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:35:39,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:39,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1906041946, now seen corresponding path program 1 times [2023-11-19 07:35:39,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:39,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044850060] [2023-11-19 07:35:39,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:39,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:40,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:40,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044850060] [2023-11-19 07:35:40,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044850060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:40,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:40,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:35:40,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206454783] [2023-11-19 07:35:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:40,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:35:40,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:40,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:35:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:35:40,665 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:41,009 INFO L93 Difference]: Finished difference Result 145 states and 193 transitions. [2023-11-19 07:35:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:35:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2023-11-19 07:35:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:41,014 INFO L225 Difference]: With dead ends: 145 [2023-11-19 07:35:41,014 INFO L226 Difference]: Without dead ends: 105 [2023-11-19 07:35:41,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:35:41,017 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 91 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:41,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 191 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:35:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-19 07:35:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2023-11-19 07:35:41,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-19 07:35:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2023-11-19 07:35:41,077 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 58 [2023-11-19 07:35:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:41,080 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2023-11-19 07:35:41,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2023-11-19 07:35:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-19 07:35:41,083 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:41,084 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:41,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:35:41,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:41,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:41,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1991142381, now seen corresponding path program 1 times [2023-11-19 07:35:41,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:41,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123689365] [2023-11-19 07:35:41,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:41,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:41,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:41,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:41,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:41,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:41,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:41,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:41,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:41,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:41,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123689365] [2023-11-19 07:35:41,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123689365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:41,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:41,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:35:41,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372410729] [2023-11-19 07:35:41,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:41,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:35:41,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:41,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:35:41,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:35:41,649 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:41,942 INFO L93 Difference]: Finished difference Result 218 states and 287 transitions. [2023-11-19 07:35:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:35:41,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-11-19 07:35:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:41,945 INFO L225 Difference]: With dead ends: 218 [2023-11-19 07:35:41,946 INFO L226 Difference]: Without dead ends: 178 [2023-11-19 07:35:41,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:35:41,949 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 92 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:41,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 230 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:35:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-19 07:35:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 119. [2023-11-19 07:35:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:35:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 161 transitions. [2023-11-19 07:35:42,007 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 161 transitions. Word has length 59 [2023-11-19 07:35:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:42,010 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 161 transitions. [2023-11-19 07:35:42,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 161 transitions. [2023-11-19 07:35:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-19 07:35:42,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:42,017 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:42,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:35:42,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:42,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:42,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1404336367, now seen corresponding path program 1 times [2023-11-19 07:35:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352162152] [2023-11-19 07:35:42,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:42,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:42,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:42,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352162152] [2023-11-19 07:35:42,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352162152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:42,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:42,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651053422] [2023-11-19 07:35:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:42,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:35:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:42,125 INFO L87 Difference]: Start difference. First operand 119 states and 161 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:42,162 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2023-11-19 07:35:42,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:42,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-11-19 07:35:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:42,168 INFO L225 Difference]: With dead ends: 190 [2023-11-19 07:35:42,168 INFO L226 Difference]: Without dead ends: 150 [2023-11-19 07:35:42,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:42,182 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:42,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 120 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:35:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-19 07:35:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2023-11-19 07:35:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 98 states have internal predecessors, (123), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:35:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 165 transitions. [2023-11-19 07:35:42,229 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 165 transitions. Word has length 59 [2023-11-19 07:35:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:42,230 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 165 transitions. [2023-11-19 07:35:42,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 165 transitions. [2023-11-19 07:35:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-19 07:35:42,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:42,233 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:42,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:35:42,234 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:42,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:42,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1793297465, now seen corresponding path program 1 times [2023-11-19 07:35:42,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:42,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572433734] [2023-11-19 07:35:42,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572433734] [2023-11-19 07:35:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572433734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:42,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:42,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:35:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270212823] [2023-11-19 07:35:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:42,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:35:42,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:42,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:35:42,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:35:42,685 INFO L87 Difference]: Start difference. First operand 123 states and 165 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:42,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:42,851 INFO L93 Difference]: Finished difference Result 281 states and 375 transitions. [2023-11-19 07:35:42,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:35:42,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-11-19 07:35:42,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:42,855 INFO L225 Difference]: With dead ends: 281 [2023-11-19 07:35:42,856 INFO L226 Difference]: Without dead ends: 180 [2023-11-19 07:35:42,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:35:42,863 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 55 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:42,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:35:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-19 07:35:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 123. [2023-11-19 07:35:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:35:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2023-11-19 07:35:42,922 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 59 [2023-11-19 07:35:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:42,924 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2023-11-19 07:35:42,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2023-11-19 07:35:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-19 07:35:42,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:42,928 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:42,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:35:42,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:42,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 136443654, now seen corresponding path program 1 times [2023-11-19 07:35:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985311131] [2023-11-19 07:35:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:45,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:45,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985311131] [2023-11-19 07:35:45,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985311131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:45,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:45,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:35:45,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182545546] [2023-11-19 07:35:45,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:45,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:35:45,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:45,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:35:45,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:35:45,520 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:45,879 INFO L93 Difference]: Finished difference Result 349 states and 460 transitions. [2023-11-19 07:35:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:35:45,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-11-19 07:35:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:45,884 INFO L225 Difference]: With dead ends: 349 [2023-11-19 07:35:45,884 INFO L226 Difference]: Without dead ends: 248 [2023-11-19 07:35:45,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-11-19 07:35:45,889 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 212 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:45,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 266 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:35:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-19 07:35:45,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 114. [2023-11-19 07:35:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 89 states have internal predecessors, (108), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:35:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 150 transitions. [2023-11-19 07:35:45,913 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 150 transitions. Word has length 60 [2023-11-19 07:35:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:45,914 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 150 transitions. [2023-11-19 07:35:45,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 150 transitions. [2023-11-19 07:35:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-19 07:35:45,915 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:45,916 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:45,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:35:45,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:45,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 112332512, now seen corresponding path program 1 times [2023-11-19 07:35:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:45,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790503085] [2023-11-19 07:35:45,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:45,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:45,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:45,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790503085] [2023-11-19 07:35:46,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790503085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:46,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:46,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:46,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751168177] [2023-11-19 07:35:46,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:46,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:35:46,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:46,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:46,008 INFO L87 Difference]: Start difference. First operand 114 states and 150 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:46,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:46,049 INFO L93 Difference]: Finished difference Result 198 states and 260 transitions. [2023-11-19 07:35:46,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:46,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-11-19 07:35:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:46,058 INFO L225 Difference]: With dead ends: 198 [2023-11-19 07:35:46,058 INFO L226 Difference]: Without dead ends: 106 [2023-11-19 07:35:46,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:46,061 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:46,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 84 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:35:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-19 07:35:46,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2023-11-19 07:35:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-19 07:35:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2023-11-19 07:35:46,089 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 60 [2023-11-19 07:35:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:46,090 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2023-11-19 07:35:46,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:46,090 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2023-11-19 07:35:46,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-19 07:35:46,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:46,091 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:46,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:35:46,092 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:46,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:46,092 INFO L85 PathProgramCache]: Analyzing trace with hash -588732066, now seen corresponding path program 1 times [2023-11-19 07:35:46,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:46,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599108337] [2023-11-19 07:35:46,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:46,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:46,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:46,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:46,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:46,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:46,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:46,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:46,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599108337] [2023-11-19 07:35:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599108337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:46,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:46,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:46,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083922875] [2023-11-19 07:35:46,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:46,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:35:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:46,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:35:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:46,198 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:46,253 INFO L93 Difference]: Finished difference Result 184 states and 239 transitions. [2023-11-19 07:35:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:35:46,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-11-19 07:35:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:46,256 INFO L225 Difference]: With dead ends: 184 [2023-11-19 07:35:46,256 INFO L226 Difference]: Without dead ends: 142 [2023-11-19 07:35:46,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:35:46,258 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:46,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 96 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:35:46,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-19 07:35:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2023-11-19 07:35:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 107 states have internal predecessors, (125), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-19 07:35:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 181 transitions. [2023-11-19 07:35:46,281 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 181 transitions. Word has length 60 [2023-11-19 07:35:46,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:46,283 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 181 transitions. [2023-11-19 07:35:46,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:46,284 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 181 transitions. [2023-11-19 07:35:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-19 07:35:46,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:46,285 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:46,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:35:46,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:46,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1764714421, now seen corresponding path program 1 times [2023-11-19 07:35:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:46,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709982510] [2023-11-19 07:35:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:46,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:47,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:47,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:47,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:47,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:47,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:47,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709982510] [2023-11-19 07:35:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709982510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:35:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243775327] [2023-11-19 07:35:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:47,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:35:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:47,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:35:47,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:35:47,305 INFO L87 Difference]: Start difference. First operand 140 states and 181 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:47,651 INFO L93 Difference]: Finished difference Result 259 states and 333 transitions. [2023-11-19 07:35:47,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:35:47,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2023-11-19 07:35:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:47,655 INFO L225 Difference]: With dead ends: 259 [2023-11-19 07:35:47,655 INFO L226 Difference]: Without dead ends: 179 [2023-11-19 07:35:47,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:35:47,656 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 75 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:47,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 156 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:35:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-19 07:35:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2023-11-19 07:35:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.170940170940171) internal successors, (137), 117 states have internal predecessors, (137), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-19 07:35:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2023-11-19 07:35:47,691 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 61 [2023-11-19 07:35:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:47,694 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2023-11-19 07:35:47,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2023-11-19 07:35:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-19 07:35:47,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:47,702 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:47,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:35:47,702 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:47,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:47,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1656971175, now seen corresponding path program 1 times [2023-11-19 07:35:47,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:47,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671876295] [2023-11-19 07:35:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:47,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:48,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:48,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:48,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:48,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:48,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:48,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671876295] [2023-11-19 07:35:48,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671876295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:48,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:48,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-19 07:35:48,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033596593] [2023-11-19 07:35:48,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:48,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:35:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:48,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:35:48,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:35:48,731 INFO L87 Difference]: Start difference. First operand 150 states and 193 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:50,121 INFO L93 Difference]: Finished difference Result 369 states and 482 transitions. [2023-11-19 07:35:50,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-19 07:35:50,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2023-11-19 07:35:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:50,125 INFO L225 Difference]: With dead ends: 369 [2023-11-19 07:35:50,125 INFO L226 Difference]: Without dead ends: 367 [2023-11-19 07:35:50,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-11-19 07:35:50,126 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 237 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:50,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 570 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 07:35:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-19 07:35:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 214. [2023-11-19 07:35:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 173 states have (on average 1.1907514450867052) internal successors, (206), 173 states have internal predecessors, (206), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-19 07:35:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 276 transitions. [2023-11-19 07:35:50,169 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 276 transitions. Word has length 63 [2023-11-19 07:35:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:50,170 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 276 transitions. [2023-11-19 07:35:50,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:50,171 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 276 transitions. [2023-11-19 07:35:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-19 07:35:50,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:50,172 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:50,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:35:50,172 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:50,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2110749848, now seen corresponding path program 1 times [2023-11-19 07:35:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:50,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572497631] [2023-11-19 07:35:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:50,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:50,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:50,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:50,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:50,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:50,846 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-19 07:35:50,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:50,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572497631] [2023-11-19 07:35:50,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572497631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:50,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:50,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 07:35:50,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540116403] [2023-11-19 07:35:50,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:50,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:35:50,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:50,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:35:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:35:50,849 INFO L87 Difference]: Start difference. First operand 214 states and 276 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:51,197 INFO L93 Difference]: Finished difference Result 249 states and 319 transitions. [2023-11-19 07:35:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:35:51,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2023-11-19 07:35:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:51,201 INFO L225 Difference]: With dead ends: 249 [2023-11-19 07:35:51,201 INFO L226 Difference]: Without dead ends: 247 [2023-11-19 07:35:51,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-19 07:35:51,202 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 78 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:51,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 418 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:35:51,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-11-19 07:35:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 214. [2023-11-19 07:35:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 173 states have (on average 1.1849710982658959) internal successors, (205), 173 states have internal predecessors, (205), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-19 07:35:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 275 transitions. [2023-11-19 07:35:51,243 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 275 transitions. Word has length 64 [2023-11-19 07:35:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:51,243 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 275 transitions. [2023-11-19 07:35:51,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-19 07:35:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 275 transitions. [2023-11-19 07:35:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-19 07:35:51,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:51,246 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:51,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:35:51,246 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:51,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash -406066346, now seen corresponding path program 1 times [2023-11-19 07:35:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:51,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000862112] [2023-11-19 07:35:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:35:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-19 07:35:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-19 07:35:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-19 07:35:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-19 07:35:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-19 07:35:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-19 07:35:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-19 07:35:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-19 07:35:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-19 07:35:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-19 07:35:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-19 07:35:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-19 07:35:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-19 07:35:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000862112] [2023-11-19 07:35:51,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000862112] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235673429] [2023-11-19 07:35:51,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:51,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:51,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:51,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:35:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:51,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:35:51,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:51,665 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-11-19 07:35:51,666 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:35:51,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235673429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:51,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:35:51,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-19 07:35:51,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782195622] [2023-11-19 07:35:51,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:51,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:35:51,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:51,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:35:51,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:35:51,669 INFO L87 Difference]: Start difference. First operand 214 states and 275 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-19 07:35:51,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:51,705 INFO L93 Difference]: Finished difference Result 251 states and 314 transitions. [2023-11-19 07:35:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:35:51,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2023-11-19 07:35:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:51,706 INFO L225 Difference]: With dead ends: 251 [2023-11-19 07:35:51,706 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:35:51,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:35:51,707 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:51,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:35:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:35:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:35:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:35:51,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2023-11-19 07:35:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:51,709 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:35:51,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-19 07:35:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:35:51,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:35:51,712 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-19 07:35:51,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:35:51,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-19 07:35:51,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:35:52,505 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-11-19 07:35:52,505 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-19 07:35:52,505 INFO L899 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2023-11-19 07:35:52,505 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-19 07:35:52,506 INFO L899 garLoopResultBuilder]: For program point L52-4(lines 52 56) no Hoare annotation was computed. [2023-11-19 07:35:52,506 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-19 07:35:52,506 INFO L899 garLoopResultBuilder]: For program point L52-6(lines 35 60) no Hoare annotation was computed. [2023-11-19 07:35:52,506 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 50) no Hoare annotation was computed. [2023-11-19 07:35:52,506 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 83 95) no Hoare annotation was computed. [2023-11-19 07:35:52,507 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-19 07:35:52,507 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-11-19 07:35:52,507 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2023-11-19 07:35:52,507 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:35:52,507 INFO L899 garLoopResultBuilder]: For program point L87-2(lines 87 93) no Hoare annotation was computed. [2023-11-19 07:35:52,508 INFO L895 garLoopResultBuilder]: At program point L87-3(lines 87 93) the Hoare annotation is: (let ((.cse3 (= 256 ~var_1_5~0)) (.cse4 (= 256 ~last_1_var_1_5~0)) (.cse6 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~k_loop~0#1|)) (.cse1 (= (+ 5 ~var_1_1~0) 0)) (.cse2 (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0)) (.cse5 (* 65536 (div ~last_1_var_1_5~0 65536))) (.cse0 (div ~last_1_var_1_11~0 4294967296))) (or (and (< ~last_1_var_1_11~0 9) (< 0 (+ .cse0 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2 .cse3 (= 8 ~var_1_11~0) .cse4) (and (= (+ .cse5 ~var_1_1~0) ~last_1_var_1_5~0) .cse6 .cse7 .cse3 (= ~var_1_1~0 ~var_1_11~0) .cse4) (and .cse6 .cse7 (= (+ 5 ~var_1_11~0) 0) .cse1 .cse2 (let ((.cse9 (+ .cse5 ~var_1_6~0)) (.cse8 (* (div ~var_1_6~0 65536) 65536))) (or (and (= (+ ~var_1_5~0 8 .cse8) ~var_1_6~0) (<= (+ 8 .cse8 ~last_1_var_1_5~0) .cse9)) (and (<= .cse9 (+ 7 .cse8 ~last_1_var_1_5~0)) (= (+ .cse5 ~var_1_5~0) ~last_1_var_1_5~0)))) (or (not (= (+ .cse5 ~last_1_var_1_11~0) (+ ~last_1_var_1_5~0 (* .cse0 4294967296)))) (= (* 65536 (div (+ ~last_1_var_1_11~0 4294967280) 65536)) (+ 4294901749 ~last_1_var_1_11~0)))))) [2023-11-19 07:35:52,509 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-11-19 07:35:52,509 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:35:52,509 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-19 07:35:52,509 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-11-19 07:35:52,509 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-19 07:35:52,510 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-19 07:35:52,510 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-19 07:35:52,510 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-11-19 07:35:52,510 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-11-19 07:35:52,510 INFO L899 garLoopResultBuilder]: For program point L47-2(lines 44 50) no Hoare annotation was computed. [2023-11-19 07:35:52,511 INFO L899 garLoopResultBuilder]: For program point L80-3(line 80) no Hoare annotation was computed. [2023-11-19 07:35:52,511 INFO L899 garLoopResultBuilder]: For program point L80-5(line 80) no Hoare annotation was computed. [2023-11-19 07:35:52,511 INFO L899 garLoopResultBuilder]: For program point L80-7(line 80) no Hoare annotation was computed. [2023-11-19 07:35:52,511 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 41) no Hoare annotation was computed. [2023-11-19 07:35:52,511 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 36 42) no Hoare annotation was computed. [2023-11-19 07:35:52,511 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-19 07:35:52,512 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-19 07:35:52,512 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 61 74) no Hoare annotation was computed. [2023-11-19 07:35:52,512 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:35:52,512 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-19 07:35:52,512 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 79 82) no Hoare annotation was computed. [2023-11-19 07:35:52,513 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-19 07:35:52,513 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 34) no Hoare annotation was computed. [2023-11-19 07:35:52,513 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-19 07:35:52,513 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:35:52,513 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 78) no Hoare annotation was computed. [2023-11-19 07:35:52,514 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-19 07:35:52,514 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 60) no Hoare annotation was computed. [2023-11-19 07:35:52,514 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-19 07:35:52,514 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-19 07:35:52,514 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-19 07:35:52,514 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-19 07:35:52,518 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:52,520 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:35:52,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:35:52 BoogieIcfgContainer [2023-11-19 07:35:52,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:35:52,534 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:35:52,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:35:52,535 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:35:52,535 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:38" (3/4) ... [2023-11-19 07:35:52,537 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:35:52,549 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-19 07:35:52,558 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-19 07:35:52,558 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-19 07:35:52,559 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 07:35:52,559 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:35:52,588 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((last_1_var_1_11 < 9) && (0 < ((last_1_var_1_11 / 4294967296) + 1))) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (1 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5))) || (((((((1 <= \result) && (1 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) [2023-11-19 07:35:52,625 WARN L141 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((last_1_var_1_11 < 9) && (0 < ((last_1_var_1_11 / 4294967296) + 1))) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (1 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5))) || (((((((1 <= \result) && (1 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) [2023-11-19 07:35:52,678 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:35:52,678 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:35:52,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:35:52,679 INFO L158 Benchmark]: Toolchain (without parser) took 15568.04ms. Allocated memory was 127.9MB in the beginning and 243.3MB in the end (delta: 115.3MB). Free memory was 84.1MB in the beginning and 207.8MB in the end (delta: -123.6MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2023-11-19 07:35:52,679 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 127.9MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:35:52,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.19ms. Allocated memory is still 127.9MB. Free memory was 83.7MB in the beginning and 71.8MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:35:52,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.13ms. Allocated memory is still 127.9MB. Free memory was 71.8MB in the beginning and 69.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:35:52,681 INFO L158 Benchmark]: Boogie Preprocessor took 40.21ms. Allocated memory is still 127.9MB. Free memory was 69.4MB in the beginning and 67.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:35:52,682 INFO L158 Benchmark]: RCFGBuilder took 803.86ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 67.7MB in the beginning and 137.5MB in the end (delta: -69.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2023-11-19 07:35:52,683 INFO L158 Benchmark]: TraceAbstraction took 14111.64ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 136.3MB in the beginning and 72.5MB in the end (delta: 63.8MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. [2023-11-19 07:35:52,683 INFO L158 Benchmark]: Witness Printer took 144.14ms. Allocated memory is still 243.3MB. Free memory was 72.5MB in the beginning and 207.8MB in the end (delta: -135.3MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2023-11-19 07:35:52,685 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 127.9MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.19ms. Allocated memory is still 127.9MB. Free memory was 83.7MB in the beginning and 71.8MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.13ms. Allocated memory is still 127.9MB. Free memory was 71.8MB in the beginning and 69.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.21ms. Allocated memory is still 127.9MB. Free memory was 69.4MB in the beginning and 67.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 803.86ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 67.7MB in the beginning and 137.5MB in the end (delta: -69.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14111.64ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 136.3MB in the beginning and 72.5MB in the end (delta: 63.8MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. * Witness Printer took 144.14ms. Allocated memory is still 243.3MB. Free memory was 72.5MB in the beginning and 207.8MB in the end (delta: -135.3MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 907 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 907 mSDsluCounter, 2439 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1670 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1119 IncrementalHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 769 mSDtfsCounter, 1119 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=10, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 531 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 134 PreInvPairs, 144 NumberOfFragments, 364 HoareAnnotationTreeSize, 134 FomulaSimplifications, 888 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 517 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 899 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 886 ConstructedInterpolants, 0 QuantifiedInterpolants, 4870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1703/1704 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((last_1_var_1_11 < 9) && (0 < ((last_1_var_1_11 / 4294967296) + 1))) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (1 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5))) || (((((((1 <= \result) && (1 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) RESULT: Ultimate proved your program to be correct! [2023-11-19 07:35:52,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1c6b58-6dfa-4bcc-a5a1-790f133f239b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE