./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme --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 5c538b08a3d83aa65ce7ffeb36d6290ee4fcb7724fc63e5e0592ab91abf7ec2d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:47:49,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:47:49,394 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:47:49,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:47:49,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:47:49,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:47:49,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:47:49,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:47:49,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:47:49,449 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:47:49,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:47:49,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:47:49,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:47:49,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:47:49,453 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:47:49,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:47:49,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:47:49,455 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:47:49,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:47:49,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:47:49,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:47:49,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:47:49,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:47:49,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:47:49,458 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:47:49,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:47:49,459 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:47:49,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:47:49,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:47:49,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:47:49,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:47:49,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:49,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:47:49,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:47:49,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:47:49,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:47:49,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:47:49,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:47:49,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:47:49,464 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:47:49,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:47:49,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:47:49,465 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_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/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_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme 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 -> 5c538b08a3d83aa65ce7ffeb36d6290ee4fcb7724fc63e5e0592ab91abf7ec2d [2023-11-26 11:47:49,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:47:49,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:47:49,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:47:49,818 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:47:49,818 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:47:49,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2023-11-26 11:47:53,104 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:47:53,330 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:47:53,330 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2023-11-26 11:47:53,342 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/data/4a7062409/3f306d21c83c4ef39dbb1b649f01e09c/FLAGa3ee513b8 [2023-11-26 11:47:53,365 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/data/4a7062409/3f306d21c83c4ef39dbb1b649f01e09c [2023-11-26 11:47:53,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:47:53,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:47:53,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:53,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:47:53,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:47:53,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3268860e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53, skipping insertion in model container [2023-11-26 11:47:53,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,428 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:47:53,619 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_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i[913,926] [2023-11-26 11:47:53,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:53,713 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:47:53,728 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_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i[913,926] [2023-11-26 11:47:53,766 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:47:53,793 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:47:53,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53 WrapperNode [2023-11-26 11:47:53,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:47:53,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:53,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:47:53,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:47:53,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,870 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2023-11-26 11:47:53,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:47:53,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:47:53,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:47:53,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:47:53,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,912 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 11:47:53,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:47:53,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:47:53,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:47:53,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:47:53,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (1/1) ... [2023-11-26 11:47:53,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:47:53,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:53,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:47:54,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:47:54,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:47:54,038 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:47:54,039 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:47:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:47:54,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:47:54,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:47:54,123 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:47:54,126 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:47:54,499 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:47:54,562 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:47:54,565 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:47:54,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:54 BoogieIcfgContainer [2023-11-26 11:47:54,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:47:54,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:47:54,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:47:54,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:47:54,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:47:53" (1/3) ... [2023-11-26 11:47:54,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ffc5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:54, skipping insertion in model container [2023-11-26 11:47:54,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:47:53" (2/3) ... [2023-11-26 11:47:54,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ffc5e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:47:54, skipping insertion in model container [2023-11-26 11:47:54,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:54" (3/3) ... [2023-11-26 11:47:54,578 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-97.i [2023-11-26 11:47:54,598 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:47:54,598 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:47:54,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:47:54,703 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;@24f584ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:47:54,704 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:47:54,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:47:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-26 11:47:54,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:54,729 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:54,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:54,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash 139205515, now seen corresponding path program 1 times [2023-11-26 11:47:54,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:54,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552054727] [2023-11-26 11:47:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:54,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:47:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:47:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:47:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:47:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:47:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:47:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:47:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:47:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:47:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:47:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:47:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:47:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:47:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:47:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:47:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:47:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-26 11:47:55,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:55,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552054727] [2023-11-26 11:47:55,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552054727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:55,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:55,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:47:55,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976213791] [2023-11-26 11:47:55,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:55,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:47:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:55,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:47:55,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:47:55,208 INFO L87 Difference]: Start difference. First operand has 55 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-26 11:47:55,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:55,251 INFO L93 Difference]: Finished difference Result 107 states and 189 transitions. [2023-11-26 11:47:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:47:55,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 104 [2023-11-26 11:47:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:55,263 INFO L225 Difference]: With dead ends: 107 [2023-11-26 11:47:55,263 INFO L226 Difference]: Without dead ends: 53 [2023-11-26 11:47:55,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-26 11:47:55,272 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:55,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:47:55,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-26 11:47:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-26 11:47:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:47:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. [2023-11-26 11:47:55,323 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 82 transitions. Word has length 104 [2023-11-26 11:47:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:55,323 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 82 transitions. [2023-11-26 11:47:55,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-26 11:47:55,324 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 82 transitions. [2023-11-26 11:47:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-26 11:47:55,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:55,328 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:55,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:47:55,329 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:55,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash 853837385, now seen corresponding path program 1 times [2023-11-26 11:47:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653455992] [2023-11-26 11:47:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:47:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:47:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:47:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:47:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:47:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:47:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:47:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:47:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:47:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:47:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:47:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:47:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:47:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:47:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:47:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:47:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-26 11:47:56,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653455992] [2023-11-26 11:47:56,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653455992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:56,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:56,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:47:56,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169406090] [2023-11-26 11:47:56,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:56,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:47:56,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:56,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:47:56,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:47:56,218 INFO L87 Difference]: Start difference. First operand 53 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:47:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:56,430 INFO L93 Difference]: Finished difference Result 150 states and 230 transitions. [2023-11-26 11:47:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:47:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 104 [2023-11-26 11:47:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:56,434 INFO L225 Difference]: With dead ends: 150 [2023-11-26 11:47:56,434 INFO L226 Difference]: Without dead ends: 98 [2023-11-26 11:47:56,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:47:56,437 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 77 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:56,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 439 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:47:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-26 11:47:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2023-11-26 11:47:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:47:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2023-11-26 11:47:56,472 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 104 [2023-11-26 11:47:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:56,476 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2023-11-26 11:47:56,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:47:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2023-11-26 11:47:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-26 11:47:56,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:56,484 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:56,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:47:56,485 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:56,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:56,486 INFO L85 PathProgramCache]: Analyzing trace with hash 991670493, now seen corresponding path program 1 times [2023-11-26 11:47:56,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:56,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30466471] [2023-11-26 11:47:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:56,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:47:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:47:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:47:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:47:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:47:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:47:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:47:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:47:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:47:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:47:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:47:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:47:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:47:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:47:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:47:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:47:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-26 11:47:56,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:57,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30466471] [2023-11-26 11:47:57,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30466471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:47:57,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:47:57,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:47:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143222837] [2023-11-26 11:47:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:47:57,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:47:57,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:57,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:47:57,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:47:57,011 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:47:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:57,499 INFO L93 Difference]: Finished difference Result 197 states and 296 transitions. [2023-11-26 11:47:57,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 11:47:57,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 105 [2023-11-26 11:47:57,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:57,508 INFO L225 Difference]: With dead ends: 197 [2023-11-26 11:47:57,508 INFO L226 Difference]: Without dead ends: 142 [2023-11-26 11:47:57,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-26 11:47:57,517 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 133 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:57,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 472 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:47:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-26 11:47:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 57. [2023-11-26 11:47:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 38 states have internal predecessors, (51), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:47:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2023-11-26 11:47:57,549 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 105 [2023-11-26 11:47:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:57,551 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2023-11-26 11:47:57,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:47:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2023-11-26 11:47:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-26 11:47:57,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:57,562 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:57,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:47:57,563 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:47:57,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:47:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash -483714034, now seen corresponding path program 1 times [2023-11-26 11:47:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:47:57,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567156274] [2023-11-26 11:47:57,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:47:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:47:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:47:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:47:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:47:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:47:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:47:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:47:58,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:47:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:47:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:47:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:47:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:47:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:47:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:47:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:47:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:47:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:47:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2023-11-26 11:47:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:47:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567156274] [2023-11-26 11:47:58,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567156274] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:47:58,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065885068] [2023-11-26 11:47:58,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:47:58,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:47:58,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:47:58,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:47:58,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:47:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:47:58,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-26 11:47:58,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:47:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 302 proven. 27 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2023-11-26 11:47:58,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:47:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2023-11-26 11:47:59,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065885068] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:47:59,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:47:59,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2023-11-26 11:47:59,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831964689] [2023-11-26 11:47:59,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:47:59,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-26 11:47:59,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:47:59,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-26 11:47:59,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-26 11:47:59,150 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-26 11:47:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:47:59,816 INFO L93 Difference]: Finished difference Result 143 states and 209 transitions. [2023-11-26 11:47:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 11:47:59,817 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 106 [2023-11-26 11:47:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:47:59,822 INFO L225 Difference]: With dead ends: 143 [2023-11-26 11:47:59,822 INFO L226 Difference]: Without dead ends: 87 [2023-11-26 11:47:59,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 236 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2023-11-26 11:47:59,834 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 81 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 11:47:59,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 158 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-26 11:47:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-26 11:47:59,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2023-11-26 11:47:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 48 states have internal predecessors, (58), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-26 11:47:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2023-11-26 11:47:59,864 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 106 [2023-11-26 11:47:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:47:59,864 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2023-11-26 11:47:59,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-26 11:47:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2023-11-26 11:47:59,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-26 11:47:59,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:47:59,867 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:47:59,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:00,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:00,075 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:00,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1856438580, now seen corresponding path program 1 times [2023-11-26 11:48:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:00,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221009247] [2023-11-26 11:48:00,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:00,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:48:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:48:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:48:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:48:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:48:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:48:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:48:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:48:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:48:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-26 11:48:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:48:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-26 11:48:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-26 11:48:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:48:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-11-26 11:48:00,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:00,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221009247] [2023-11-26 11:48:00,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221009247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:00,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:48:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429314400] [2023-11-26 11:48:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:00,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:48:00,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:00,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:48:00,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:00,448 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:48:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:00,884 INFO L93 Difference]: Finished difference Result 190 states and 265 transitions. [2023-11-26 11:48:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:48:00,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 106 [2023-11-26 11:48:00,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:00,892 INFO L225 Difference]: With dead ends: 190 [2023-11-26 11:48:00,893 INFO L226 Difference]: Without dead ends: 128 [2023-11-26 11:48:00,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:48:00,894 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 146 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:00,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 392 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:48:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-26 11:48:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2023-11-26 11:48:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 75 states have internal predecessors, (87), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-26 11:48:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 175 transitions. [2023-11-26 11:48:00,977 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 175 transitions. Word has length 106 [2023-11-26 11:48:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:00,978 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 175 transitions. [2023-11-26 11:48:00,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-11-26 11:48:00,978 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 175 transitions. [2023-11-26 11:48:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-26 11:48:00,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:00,980 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:00,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:48:00,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:00,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:00,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1170083422, now seen corresponding path program 1 times [2023-11-26 11:48:00,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:00,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271505394] [2023-11-26 11:48:00,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:00,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:48:01,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:48:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:48:01,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:48:01,141 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:48:01,142 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:48:01,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:48:01,148 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-26 11:48:01,152 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:48:01,259 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated [2023-11-26 11:48:01,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite15 could not be translated [2023-11-26 11:48:01,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated [2023-11-26 11:48:01,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated [2023-11-26 11:48:01,262 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite15 could not be translated [2023-11-26 11:48:01,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:48:01 BoogieIcfgContainer [2023-11-26 11:48:01,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:48:01,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:48:01,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:48:01,294 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:48:01,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:47:54" (3/4) ... [2023-11-26 11:48:01,297 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:48:01,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:48:01,299 INFO L158 Benchmark]: Toolchain (without parser) took 7926.21ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 132.7MB in the beginning and 165.0MB in the end (delta: -32.3MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-11-26 11:48:01,300 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 113.2MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:48:01,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.78ms. Allocated memory is still 169.9MB. Free memory was 132.3MB in the beginning and 120.1MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 11:48:01,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.23ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 117.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:48:01,301 INFO L158 Benchmark]: Boogie Preprocessor took 80.33ms. Allocated memory is still 169.9MB. Free memory was 117.6MB in the beginning and 115.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:48:01,301 INFO L158 Benchmark]: RCFGBuilder took 614.07ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 97.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-26 11:48:01,301 INFO L158 Benchmark]: TraceAbstraction took 6724.05ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 96.3MB in the beginning and 165.0MB in the end (delta: -68.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:48:01,302 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 228.6MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:48:01,305 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.36ms. Allocated memory is still 113.2MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.78ms. Allocated memory is still 169.9MB. Free memory was 132.3MB in the beginning and 120.1MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.23ms. Allocated memory is still 169.9MB. Free memory was 120.1MB in the beginning and 117.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.33ms. Allocated memory is still 169.9MB. Free memory was 117.6MB in the beginning and 115.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 614.07ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 97.2MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6724.05ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 96.3MB in the beginning and 165.0MB in the end (delta: -68.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 228.6MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite15 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed short int var_1_7 = 32; [L24] signed short int var_1_8 = 20113; [L25] signed short int var_1_9 = 100; [L26] signed char var_1_10 = 100; [L27] signed char var_1_11 = -1; [L28] signed char var_1_12 = 16; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_15 = 0; [L31] unsigned char var_1_16 = 1; [L32] unsigned short int var_1_18 = 10; [L33] unsigned short int var_1_19 = 256; [L34] float var_1_20 = 32.5; [L35] float var_1_21 = 127.4; [L36] signed short int var_1_22 = 128; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L70] var_1_7 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L71] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L72] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L72] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=20113, var_1_9=100] [L73] var_1_8 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L74] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L75] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L75] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=100] [L76] var_1_9 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L78] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L78] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, var_1_10=100, var_1_11=-1, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L79] var_1_11 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L80] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L81] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L81] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=16, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L82] var_1_12 = __VERIFIER_nondet_char() [L83] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L83] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L84] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L84] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=0, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L85] var_1_15 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L86] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L87] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L87] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L88] var_1_16 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L89] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L90] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L90] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=256, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L91] var_1_19 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L92] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L93] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L93] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_21=637/5, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L94] var_1_21 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L95] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=10, var_1_19=0, var_1_1=16, var_1_20=65/2, var_1_22=128, var_1_7=0, var_1_8=16383, var_1_9=16382] [L108] RET updateVariables() [L109] CALL step() [L40] var_1_18 = var_1_19 [L41] var_1_20 = var_1_21 [L42] var_1_22 = var_1_12 VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L43] COND TRUE 127.5f > var_1_20 [L44] var_1_13 = (var_1_15 && var_1_16) VAL [isInitial=1, var_1_10=100, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L48] COND TRUE var_1_18 == var_1_7 [L49] var_1_10 = (var_1_11 + (var_1_12 + -25)) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L57] COND TRUE \read(var_1_13) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L58] COND FALSE !(var_1_10 > var_1_22) [L65] var_1_1 = 8 VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L100] EXPR (var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L100] EXPR (var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1)) VAL [isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L100-L101] return (((((var_1_13 ? ((var_1_10 > var_1_22) ? (var_1_13 ? (var_1_1 == ((signed short int) (var_1_7 - (var_1_8 - var_1_9)))) : (var_1_1 == ((signed short int) var_1_18))) : (var_1_1 == ((signed short int) 8))) : 1) && ((var_1_18 == var_1_7) ? (var_1_10 == ((signed char) (var_1_11 + (var_1_12 + -25)))) : ((((32 * -25) | var_1_22) >= var_1_11) ? (var_1_13 ? (var_1_10 == ((signed char) var_1_12)) : 1) : 1))) && ((127.5f > var_1_20) ? (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))) : (var_1_13 == ((unsigned char) ((var_1_20 >= var_1_20) || var_1_15))))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((float) var_1_21))) && (var_1_22 == ((signed short int) var_1_12)) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=-119, var_1_11=-63, var_1_12=-31, var_1_13=1, var_1_15=1, var_1_16=1, var_1_18=0, var_1_19=0, var_1_1=8, var_1_20=20118, var_1_21=20118, var_1_22=-31, var_1_7=0, var_1_8=16383, var_1_9=16382] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 452 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 437 mSDsluCounter, 1540 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1004 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 536 mSDtfsCounter, 571 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 400 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 140 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 738 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 1924 SizeOfPredicates, 6 NumberOfNonLiveVariables, 255 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 3724/3808 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 11:48:01,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme --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 5c538b08a3d83aa65ce7ffeb36d6290ee4fcb7724fc63e5e0592ab91abf7ec2d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:48:04,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:48:04,295 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-26 11:48:04,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:48:04,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:48:04,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:48:04,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:48:04,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:48:04,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:48:04,354 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:48:04,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:48:04,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:48:04,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:48:04,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:48:04,358 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:48:04,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:48:04,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:48:04,360 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:48:04,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:48:04,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:48:04,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:48:04,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:48:04,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:48:04,364 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:48:04,365 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:48:04,365 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:48:04,365 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:48:04,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:48:04,366 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:48:04,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:48:04,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:48:04,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:48:04,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:48:04,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:04,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:48:04,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:48:04,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:48:04,372 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:48:04,372 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:48:04,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:48:04,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:48:04,373 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:48:04,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:48:04,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:48:04,374 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:48:04,374 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_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/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_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme 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 -> 5c538b08a3d83aa65ce7ffeb36d6290ee4fcb7724fc63e5e0592ab91abf7ec2d [2023-11-26 11:48:04,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:48:04,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:48:04,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:48:04,879 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:48:04,880 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:48:04,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2023-11-26 11:48:08,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:48:08,487 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:48:08,488 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i [2023-11-26 11:48:08,497 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/data/350b73a69/5c4ccbcd0c6a41a199307cf336a94f1a/FLAG5b34d3ea3 [2023-11-26 11:48:08,516 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/data/350b73a69/5c4ccbcd0c6a41a199307cf336a94f1a [2023-11-26 11:48:08,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:48:08,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:48:08,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:08,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:48:08,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:48:08,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:08,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a979624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08, skipping insertion in model container [2023-11-26 11:48:08,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:08,579 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:48:08,789 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_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i[913,926] [2023-11-26 11:48:08,862 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:08,889 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:48:08,907 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_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-97.i[913,926] [2023-11-26 11:48:08,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:08,971 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:48:08,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08 WrapperNode [2023-11-26 11:48:08,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:08,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:08,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:48:08,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:48:08,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,046 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2023-11-26 11:48:09,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:09,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:48:09,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:48:09,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:48:09,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,105 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 11:48:09,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,125 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:48:09,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:48:09,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:48:09,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:48:09,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (1/1) ... [2023-11-26 11:48:09,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:09,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:09,184 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:48:09,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:48:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:48:09,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:48:09,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:48:09,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:48:09,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:48:09,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:48:09,344 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:48:09,347 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:48:09,711 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:48:09,774 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:48:09,775 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:48:09,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:09 BoogieIcfgContainer [2023-11-26 11:48:09,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:48:09,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:48:09,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:48:09,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:48:09,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:48:08" (1/3) ... [2023-11-26 11:48:09,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9915e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:09, skipping insertion in model container [2023-11-26 11:48:09,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:08" (2/3) ... [2023-11-26 11:48:09,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9915e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:09, skipping insertion in model container [2023-11-26 11:48:09,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:09" (3/3) ... [2023-11-26 11:48:09,787 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-97.i [2023-11-26 11:48:09,809 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:48:09,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:48:09,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:48:09,873 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;@4e196125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:48:09,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:48:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:48:09,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-26 11:48:09,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:09,896 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:09,896 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:09,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:09,903 INFO L85 PathProgramCache]: Analyzing trace with hash -320415703, now seen corresponding path program 1 times [2023-11-26 11:48:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:48:09,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515948684] [2023-11-26 11:48:09,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:09,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:48:09,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:48:09,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:48:09,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-26 11:48:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:10,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-26 11:48:10,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:10,377 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2023-11-26 11:48:10,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:48:10,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:48:10,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515948684] [2023-11-26 11:48:10,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515948684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:10,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:10,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:48:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304184968] [2023-11-26 11:48:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:10,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:48:10,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:48:10,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:48:10,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:48:10,454 INFO L87 Difference]: Start difference. First operand has 46 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-26 11:48:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:10,535 INFO L93 Difference]: Finished difference Result 89 states and 159 transitions. [2023-11-26 11:48:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:48:10,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 102 [2023-11-26 11:48:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:10,552 INFO L225 Difference]: With dead ends: 89 [2023-11-26 11:48:10,553 INFO L226 Difference]: Without dead ends: 44 [2023-11-26 11:48:10,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-26 11:48:10,565 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:10,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:10,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-11-26 11:48:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-11-26 11:48:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-26 11:48:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2023-11-26 11:48:10,649 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 102 [2023-11-26 11:48:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:10,650 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2023-11-26 11:48:10,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-26 11:48:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2023-11-26 11:48:10,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-26 11:48:10,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:10,657 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:10,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:10,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:48:10,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:10,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:10,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2071386727, now seen corresponding path program 1 times [2023-11-26 11:48:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:48:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744558415] [2023-11-26 11:48:10,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:10,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:48:10,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:48:10,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:48:10,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 11:48:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:11,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:48:11,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 302 proven. 27 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2023-11-26 11:48:11,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:48:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 63 proven. 30 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2023-11-26 11:48:11,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:48:11,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744558415] [2023-11-26 11:48:11,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744558415] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:48:11,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-26 11:48:11,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-26 11:48:11,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039780282] [2023-11-26 11:48:11,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-26 11:48:11,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-26 11:48:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:48:11,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-26 11:48:11,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-26 11:48:11,885 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-26 11:48:12,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:12,809 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2023-11-26 11:48:12,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-26 11:48:12,810 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 102 [2023-11-26 11:48:12,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:12,813 INFO L225 Difference]: With dead ends: 118 [2023-11-26 11:48:12,813 INFO L226 Difference]: Without dead ends: 75 [2023-11-26 11:48:12,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2023-11-26 11:48:12,816 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 102 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:12,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 119 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-26 11:48:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-26 11:48:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2023-11-26 11:48:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-26 11:48:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2023-11-26 11:48:12,839 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 102 [2023-11-26 11:48:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:12,841 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2023-11-26 11:48:12,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (23), 3 states have call predecessors, (23), 7 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-26 11:48:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2023-11-26 11:48:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-26 11:48:12,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:12,844 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:12,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:13,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:48:13,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:48:13,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -226535538, now seen corresponding path program 1 times [2023-11-26 11:48:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:48:13,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500695752] [2023-11-26 11:48:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:13,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:48:13,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:48:13,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:48:13,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7486982c-fc0a-4450-b6a0-a8fa5c2b7b64/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-26 11:48:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:13,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-26 11:48:13,243 INFO L285 TraceCheckSpWp]: Computing forward predicates...