./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU --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 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:03:36,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:03:36,606 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:03:36,614 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:03:36,615 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:03:36,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:03:36,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:03:36,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:03:36,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:03:36,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:03:36,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:03:36,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:03:36,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:03:36,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:03:36,665 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:03:36,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:03:36,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:03:36,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:03:36,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:03:36,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:03:36,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:03:36,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:03:36,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:03:36,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:03:36,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:03:36,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:03:36,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:03:36,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:03:36,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:03:36,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:03:36,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:03:36,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:03:36,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:03:36,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:03:36,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:03:36,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:03:36,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:03:36,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:03:36,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:03:36,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:03:36,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:03:36,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:03:36,683 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_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/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_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 [2024-10-31 22:03:36,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:03:37,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:03:37,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:03:37,026 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:03:37,027 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:03:37,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i Unable to find full path for "g++" [2024-10-31 22:03:39,319 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:03:39,583 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:03:39,586 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2024-10-31 22:03:39,598 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/data/0675a3c29/3a7656d90edf49a189f5954511fa934a/FLAGc7c749f55 [2024-10-31 22:03:39,620 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/data/0675a3c29/3a7656d90edf49a189f5954511fa934a [2024-10-31 22:03:39,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:03:39,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:03:39,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:03:39,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:03:39,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:03:39,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:03:39" (1/1) ... [2024-10-31 22:03:39,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4d83ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:39, skipping insertion in model container [2024-10-31 22:03:39,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:03:39" (1/1) ... [2024-10-31 22:03:39,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:03:39,909 WARN L251 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_9eccfd11-d153-407a-8cf3-6988c2128d9e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i[913,926] [2024-10-31 22:03:39,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:03:39,975 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:03:39,989 WARN L251 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_9eccfd11-d153-407a-8cf3-6988c2128d9e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i[913,926] [2024-10-31 22:03:40,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:03:40,038 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:03:40,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40 WrapperNode [2024-10-31 22:03:40,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:03:40,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:03:40,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:03:40,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:03:40,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,123 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-10-31 22:03:40,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:03:40,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:03:40,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:03:40,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:03:40,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,180 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]. [2024-10-31 22:03:40,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:03:40,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:03:40,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:03:40,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:03:40,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (1/1) ... [2024-10-31 22:03:40,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:03:40,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:03:40,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:03:40,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:03:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:03:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:03:40,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:03:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:03:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:03:40,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:03:40,413 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:03:40,418 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:03:40,891 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-31 22:03:40,891 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:03:40,910 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:03:40,911 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:03:40,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:40 BoogieIcfgContainer [2024-10-31 22:03:40,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:03:40,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:03:40,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:03:40,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:03:40,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:03:39" (1/3) ... [2024-10-31 22:03:40,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee45051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:03:40, skipping insertion in model container [2024-10-31 22:03:40,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:03:40" (2/3) ... [2024-10-31 22:03:40,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee45051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:03:40, skipping insertion in model container [2024-10-31 22:03:40,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:40" (3/3) ... [2024-10-31 22:03:40,923 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-33.i [2024-10-31 22:03:40,943 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:03:40,943 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:03:41,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:03:41,041 INFO L333 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, 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;@1696b8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:03:41,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:03:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-31 22:03:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-31 22:03:41,061 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:41,062 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:41,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:41,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash 123038288, now seen corresponding path program 1 times [2024-10-31 22:03:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:41,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327079231] [2024-10-31 22:03:41,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:41,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:41,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:41,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:41,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:41,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:41,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:41,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:03:41,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:41,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327079231] [2024-10-31 22:03:41,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327079231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:41,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:41,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:03:41,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120712258] [2024-10-31 22:03:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:41,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:03:41,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:41,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:03:41,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:03:41,516 INFO L87 Difference]: Start difference. First operand has 66 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-31 22:03:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:41,542 INFO L93 Difference]: Finished difference Result 125 states and 197 transitions. [2024-10-31 22:03:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:03:41,545 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 74 [2024-10-31 22:03:41,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:41,554 INFO L225 Difference]: With dead ends: 125 [2024-10-31 22:03:41,554 INFO L226 Difference]: Without dead ends: 62 [2024-10-31 22:03:41,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:03:41,565 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:41,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-31 22:03:41,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-31 22:03:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-31 22:03:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2024-10-31 22:03:41,627 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 74 [2024-10-31 22:03:41,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:41,628 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2024-10-31 22:03:41,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-31 22:03:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2024-10-31 22:03:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-31 22:03:41,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:41,634 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:41,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:03:41,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:41,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1283939178, now seen corresponding path program 1 times [2024-10-31 22:03:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:41,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024254323] [2024-10-31 22:03:41,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:41,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:03:42,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:42,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024254323] [2024-10-31 22:03:42,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024254323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:42,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:42,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549012790] [2024-10-31 22:03:42,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:42,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:42,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:42,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:42,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:42,145 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:42,191 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2024-10-31 22:03:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:42,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-10-31 22:03:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:42,194 INFO L225 Difference]: With dead ends: 122 [2024-10-31 22:03:42,194 INFO L226 Difference]: Without dead ends: 63 [2024-10-31 22:03:42,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:42,196 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:42,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-31 22:03:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-10-31 22:03:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-31 22:03:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 91 transitions. [2024-10-31 22:03:42,207 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 91 transitions. Word has length 74 [2024-10-31 22:03:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:42,209 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 91 transitions. [2024-10-31 22:03:42,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 91 transitions. [2024-10-31 22:03:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-31 22:03:42,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:42,212 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:42,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:03:42,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:42,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash -603880808, now seen corresponding path program 1 times [2024-10-31 22:03:42,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:42,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310792392] [2024-10-31 22:03:42,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:42,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:42,418 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:03:42,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:42,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310792392] [2024-10-31 22:03:42,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310792392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:42,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:42,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:03:42,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33171762] [2024-10-31 22:03:42,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:42,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:03:42,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:42,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:03:42,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:03:42,427 INFO L87 Difference]: Start difference. First operand 63 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:42,717 INFO L93 Difference]: Finished difference Result 148 states and 214 transitions. [2024-10-31 22:03:42,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:03:42,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-10-31 22:03:42,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:42,722 INFO L225 Difference]: With dead ends: 148 [2024-10-31 22:03:42,722 INFO L226 Difference]: Without dead ends: 88 [2024-10-31 22:03:42,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:03:42,726 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 85 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:42,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 275 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:03:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-31 22:03:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2024-10-31 22:03:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-31 22:03:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-10-31 22:03:42,740 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 74 [2024-10-31 22:03:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:42,741 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-10-31 22:03:42,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-10-31 22:03:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-31 22:03:42,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:42,743 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:42,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:03:42,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:42,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:42,744 INFO L85 PathProgramCache]: Analyzing trace with hash -345715370, now seen corresponding path program 1 times [2024-10-31 22:03:42,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:42,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688253174] [2024-10-31 22:03:42,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:42,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:03:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:46,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688253174] [2024-10-31 22:03:46,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688253174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:46,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:46,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:03:46,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617706456] [2024-10-31 22:03:46,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:46,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:03:46,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:46,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:03:46,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:03:46,235 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:47,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:47,291 INFO L93 Difference]: Finished difference Result 268 states and 388 transitions. [2024-10-31 22:03:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:03:47,292 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-10-31 22:03:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:47,295 INFO L225 Difference]: With dead ends: 268 [2024-10-31 22:03:47,295 INFO L226 Difference]: Without dead ends: 206 [2024-10-31 22:03:47,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:03:47,297 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 363 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:47,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 280 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:03:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-31 22:03:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 89. [2024-10-31 22:03:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 78 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-31 22:03:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 129 transitions. [2024-10-31 22:03:47,313 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 129 transitions. Word has length 74 [2024-10-31 22:03:47,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:47,313 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 129 transitions. [2024-10-31 22:03:47,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 129 transitions. [2024-10-31 22:03:47,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-31 22:03:47,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:47,319 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:47,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:03:47,320 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:47,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1955107220, now seen corresponding path program 1 times [2024-10-31 22:03:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:47,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183932812] [2024-10-31 22:03:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:47,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:47,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:47,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:47,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:47,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:47,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:47,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:47,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:47,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:47,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:03:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:47,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183932812] [2024-10-31 22:03:47,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183932812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:03:47,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302744118] [2024-10-31 22:03:47,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:47,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:03:47,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:47,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:03:48,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:03:48,000 INFO L87 Difference]: Start difference. First operand 89 states and 129 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:48,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:48,462 INFO L93 Difference]: Finished difference Result 207 states and 301 transitions. [2024-10-31 22:03:48,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:03:48,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 74 [2024-10-31 22:03:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:48,465 INFO L225 Difference]: With dead ends: 207 [2024-10-31 22:03:48,466 INFO L226 Difference]: Without dead ends: 121 [2024-10-31 22:03:48,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:03:48,467 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:48,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 204 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:03:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-31 22:03:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2024-10-31 22:03:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-31 22:03:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2024-10-31 22:03:48,477 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 74 [2024-10-31 22:03:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:48,478 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2024-10-31 22:03:48,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2024-10-31 22:03:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-31 22:03:48,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:48,480 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:48,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:03:48,481 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:48,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash 212492637, now seen corresponding path program 1 times [2024-10-31 22:03:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:48,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176915645] [2024-10-31 22:03:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:03:48,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:48,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176915645] [2024-10-31 22:03:48,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176915645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:48,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:48,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:48,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987113285] [2024-10-31 22:03:48,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:48,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:48,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:48,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:48,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:48,559 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:48,641 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2024-10-31 22:03:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:48,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2024-10-31 22:03:48,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:48,643 INFO L225 Difference]: With dead ends: 196 [2024-10-31 22:03:48,644 INFO L226 Difference]: Without dead ends: 122 [2024-10-31 22:03:48,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:48,645 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 54 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:48,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 183 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:03:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-31 22:03:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2024-10-31 22:03:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-31 22:03:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-10-31 22:03:48,660 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 75 [2024-10-31 22:03:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:48,661 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-10-31 22:03:48,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-10-31 22:03:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-31 22:03:48,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:48,666 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:48,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:03:48,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:48,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2016158326, now seen corresponding path program 1 times [2024-10-31 22:03:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85381065] [2024-10-31 22:03:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:48,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:03:48,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:48,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85381065] [2024-10-31 22:03:48,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85381065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:48,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:48,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:48,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567325232] [2024-10-31 22:03:48,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:48,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:48,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:48,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:48,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:48,762 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:48,824 INFO L93 Difference]: Finished difference Result 207 states and 295 transitions. [2024-10-31 22:03:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:48,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 75 [2024-10-31 22:03:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:48,826 INFO L225 Difference]: With dead ends: 207 [2024-10-31 22:03:48,826 INFO L226 Difference]: Without dead ends: 120 [2024-10-31 22:03:48,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:48,828 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 75 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:48,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 143 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:03:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-31 22:03:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2024-10-31 22:03:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-31 22:03:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-10-31 22:03:48,846 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 75 [2024-10-31 22:03:48,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:48,847 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-10-31 22:03:48,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-10-31 22:03:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-31 22:03:48,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:48,852 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:48,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:03:48,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash -31631447, now seen corresponding path program 1 times [2024-10-31 22:03:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:48,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193133182] [2024-10-31 22:03:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:49,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:49,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:49,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:03:49,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:49,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193133182] [2024-10-31 22:03:49,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193133182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:49,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:49,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:03:49,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026829703] [2024-10-31 22:03:49,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:49,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:03:49,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:03:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:03:49,025 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:49,366 INFO L93 Difference]: Finished difference Result 241 states and 333 transitions. [2024-10-31 22:03:49,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:03:49,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2024-10-31 22:03:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:49,369 INFO L225 Difference]: With dead ends: 241 [2024-10-31 22:03:49,369 INFO L226 Difference]: Without dead ends: 166 [2024-10-31 22:03:49,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:03:49,370 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 201 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:49,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 314 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:03:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-31 22:03:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2024-10-31 22:03:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 137 states have internal predecessors, (180), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:03:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 220 transitions. [2024-10-31 22:03:49,398 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 220 transitions. Word has length 76 [2024-10-31 22:03:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:49,400 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 220 transitions. [2024-10-31 22:03:49,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 220 transitions. [2024-10-31 22:03:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-31 22:03:49,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:49,402 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:49,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:03:49,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:49,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash -618437461, now seen corresponding path program 1 times [2024-10-31 22:03:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:49,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145248260] [2024-10-31 22:03:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:49,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:50,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:51,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:51,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:51,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:51,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:51,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:51,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:51,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:03:51,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:51,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145248260] [2024-10-31 22:03:51,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145248260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:51,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:51,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:03:51,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874751237] [2024-10-31 22:03:51,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:51,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:03:51,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:51,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:03:51,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:03:51,038 INFO L87 Difference]: Start difference. First operand 160 states and 220 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:52,223 INFO L93 Difference]: Finished difference Result 467 states and 645 transitions. [2024-10-31 22:03:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:03:52,226 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2024-10-31 22:03:52,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:52,229 INFO L225 Difference]: With dead ends: 467 [2024-10-31 22:03:52,229 INFO L226 Difference]: Without dead ends: 314 [2024-10-31 22:03:52,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:03:52,231 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 265 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:52,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 331 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 22:03:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-31 22:03:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 180. [2024-10-31 22:03:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.3483870967741935) internal successors, (209), 157 states have internal predecessors, (209), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-31 22:03:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 249 transitions. [2024-10-31 22:03:52,248 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 249 transitions. Word has length 76 [2024-10-31 22:03:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:52,249 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 249 transitions. [2024-10-31 22:03:52,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 249 transitions. [2024-10-31 22:03:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-31 22:03:52,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:52,250 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:52,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:03:52,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:52,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1436085911, now seen corresponding path program 1 times [2024-10-31 22:03:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:52,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699198116] [2024-10-31 22:03:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:52,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:03:52,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:52,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699198116] [2024-10-31 22:03:52,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699198116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:03:52,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:03:52,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:03:52,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104324778] [2024-10-31 22:03:52,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:03:52,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:03:52,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:52,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:03:52,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:52,405 INFO L87 Difference]: Start difference. First operand 180 states and 249 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:52,510 INFO L93 Difference]: Finished difference Result 504 states and 698 transitions. [2024-10-31 22:03:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:03:52,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 76 [2024-10-31 22:03:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:52,513 INFO L225 Difference]: With dead ends: 504 [2024-10-31 22:03:52,514 INFO L226 Difference]: Without dead ends: 331 [2024-10-31 22:03:52,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:03:52,515 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 61 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:52,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 174 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:03:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-31 22:03:52,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 260. [2024-10-31 22:03:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 224 states have (on average 1.3348214285714286) internal successors, (299), 226 states have internal predecessors, (299), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-31 22:03:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 357 transitions. [2024-10-31 22:03:52,539 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 357 transitions. Word has length 76 [2024-10-31 22:03:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:52,540 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 357 transitions. [2024-10-31 22:03:52,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-31 22:03:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 357 transitions. [2024-10-31 22:03:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-31 22:03:52,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:52,542 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:52,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:03:52,543 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:52,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1752940520, now seen corresponding path program 1 times [2024-10-31 22:03:52,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:52,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960126294] [2024-10-31 22:03:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:03:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:03:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:03:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:03:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:03:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-31 22:03:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-31 22:03:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-31 22:03:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-31 22:03:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-31 22:03:52,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:03:52,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960126294] [2024-10-31 22:03:52,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960126294] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:03:52,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582867707] [2024-10-31 22:03:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:52,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:03:52,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:03:52,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:03:52,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:03:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:03:52,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-31 22:03:52,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:03:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-31 22:03:53,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:03:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-31 22:03:53,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582867707] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:03:53,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:03:53,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2024-10-31 22:03:53,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489476249] [2024-10-31 22:03:53,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:03:53,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-31 22:03:53,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:03:53,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-31 22:03:53,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:03:53,411 INFO L87 Difference]: Start difference. First operand 260 states and 357 transitions. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-10-31 22:03:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:03:54,246 INFO L93 Difference]: Finished difference Result 872 states and 1163 transitions. [2024-10-31 22:03:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-31 22:03:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) Word has length 77 [2024-10-31 22:03:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:03:54,253 INFO L225 Difference]: With dead ends: 872 [2024-10-31 22:03:54,253 INFO L226 Difference]: Without dead ends: 768 [2024-10-31 22:03:54,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2024-10-31 22:03:54,256 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 1031 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:03:54,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 712 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:03:54,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-10-31 22:03:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 278. [2024-10-31 22:03:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 220 states have (on average 1.2636363636363637) internal successors, (278), 221 states have internal predecessors, (278), 45 states have call successors, (45), 12 states have call predecessors, (45), 12 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-31 22:03:54,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 368 transitions. [2024-10-31 22:03:54,313 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 368 transitions. Word has length 77 [2024-10-31 22:03:54,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:03:54,313 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 368 transitions. [2024-10-31 22:03:54,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 16 states have internal predecessors, (67), 6 states have call successors, (27), 3 states have call predecessors, (27), 5 states have return successors, (27), 3 states have call predecessors, (27), 6 states have call successors, (27) [2024-10-31 22:03:54,314 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 368 transitions. [2024-10-31 22:03:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-31 22:03:54,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:03:54,316 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:54,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:03:54,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:03:54,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:03:54,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:03:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1330238694, now seen corresponding path program 1 times [2024-10-31 22:03:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:03:54,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539229773] [2024-10-31 22:03:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:03:54,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:03:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:54,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:03:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:03:54,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:03:54,626 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:03:54,627 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:03:54,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:03:54,633 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:03:54,724 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:03:54,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:03:54 BoogieIcfgContainer [2024-10-31 22:03:54,730 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:03:54,731 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:03:54,731 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:03:54,731 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:03:54,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:03:40" (3/4) ... [2024-10-31 22:03:54,738 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:03:54,739 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:03:54,740 INFO L158 Benchmark]: Toolchain (without parser) took 15115.11ms. Allocated memory was 117.4MB in the beginning and 281.0MB in the end (delta: 163.6MB). Free memory was 77.5MB in the beginning and 87.7MB in the end (delta: -10.2MB). Peak memory consumption was 156.5MB. Max. memory is 16.1GB. [2024-10-31 22:03:54,741 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 82.1MB in the end (delta: 29.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:03:54,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.85ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 62.9MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 22:03:54,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.10ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 62.9MB in the beginning and 130.9MB in the end (delta: -67.9MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-10-31 22:03:54,742 INFO L158 Benchmark]: Boogie Preprocessor took 77.11ms. Allocated memory is still 159.4MB. Free memory was 130.9MB in the beginning and 128.2MB in the end (delta: 2.6MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-10-31 22:03:54,742 INFO L158 Benchmark]: RCFGBuilder took 709.62ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 107.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-31 22:03:54,743 INFO L158 Benchmark]: TraceAbstraction took 13815.34ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 107.3MB in the beginning and 87.7MB in the end (delta: 19.6MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2024-10-31 22:03:54,743 INFO L158 Benchmark]: Witness Printer took 8.96ms. Allocated memory is still 281.0MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:03:54,746 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.28ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 82.1MB in the end (delta: 29.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.85ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 62.9MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.10ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 62.9MB in the beginning and 130.9MB in the end (delta: -67.9MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.11ms. Allocated memory is still 159.4MB. Free memory was 130.9MB in the beginning and 128.2MB in the end (delta: 2.6MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * RCFGBuilder took 709.62ms. Allocated memory is still 159.4MB. Free memory was 128.2MB in the beginning and 107.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13815.34ms. Allocated memory was 159.4MB in the beginning and 281.0MB in the end (delta: 121.6MB). Free memory was 107.3MB in the beginning and 87.7MB in the end (delta: 19.6MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. * Witness Printer took 8.96ms. Allocated memory is still 281.0MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 84, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] signed short int var_1_5 = 4; [L24] unsigned char var_1_7 = 200; [L25] unsigned char var_1_8 = 32; [L26] float var_1_9 = 256.5; [L27] float var_1_10 = -0.25; [L28] float var_1_11 = 0.30000000000000004; [L29] float var_1_12 = 49.5; [L30] signed long int var_1_13 = -8; [L31] unsigned char var_1_14 = 0; [L32] float var_1_15 = 0.4; [L33] signed long int var_1_16 = -256; [L34] signed long int last_1_var_1_13 = -8; VAL [isInitial=0, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=4, var_1_7=200, var_1_8=32, var_1_9=513/2] [L91] RET updateLastVariables() [L92] CALL updateVariables() [L64] var_1_5 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L65] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L66] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=32, var_1_9=513/2] [L67] var_1_8 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_9=513/2] [L69] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L69] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L70] var_1_10 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L71] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=7500000000000001/25000000000000000, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L72] var_1_11 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L73] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_12=99/2, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L74] var_1_12 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L75] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L76] var_1_14 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L78] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(var_1_5 < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=-8, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=-256, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L41] var_1_16 = var_1_7 [L42] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=-8, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L43] COND TRUE ! var_1_14 [L44] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_13=0, var_1_14=0, var_1_15=2/5, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L52] var_1_15 = var_1_11 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-10, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L53] signed long int stepLocal_0 = (var_1_13 ^ var_1_7) + var_1_16; [L54] COND FALSE !(stepLocal_0 < -1) [L57] var_1_1 = (128 - (var_1_7 + var_1_7)) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, stepLocal_1=200, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L59] COND FALSE !(var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR var_1_13 ^ var_1_7 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_7 | var_1_16 VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR var_1_13 & (var_1_7 | var_1_16) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84] EXPR (((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L84-L85] return ((((((((var_1_13 ^ var_1_7) + var_1_16) < -1) ? (var_1_1 == ((signed short int) 8)) : (var_1_1 == ((signed short int) (128 - (var_1_7 + var_1_7))))) && ((var_1_5 < last_1_var_1_13) ? (var_1_7 == ((unsigned char) (var_1_8 + 1))) : 1)) && ((var_1_7 < (var_1_13 & (var_1_7 | var_1_16))) ? (var_1_9 == ((float) ((((var_1_10 + (var_1_11 - var_1_12)) < 0 ) ? -(var_1_10 + (var_1_11 - var_1_12)) : (var_1_10 + (var_1_11 - var_1_12)))))) : 1)) && ((! var_1_14) ? (var_1_13 == ((signed long int) var_1_8)) : ((var_1_7 > (var_1_7 + var_1_7)) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_16))))) && (var_1_15 == ((float) var_1_11))) && (var_1_16 == ((signed long int) var_1_7)) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, var_1_11=405, var_1_13=0, var_1_14=0, var_1_15=405, var_1_16=200, var_1_1=-272, var_1_5=0, var_1_7=200, var_1_8=0, var_1_9=513/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 12, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2283 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2275 mSDsluCounter, 2878 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1946 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1835 IncrementalHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 932 mSDtfsCounter, 1835 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=11, InterpolantAutomatonStates: 78, 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, 11 MinimizatonAttempts, 959 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 4575 SizeOfPredicates, 4 NumberOfNonLiveVariables, 197 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 1800/1872 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 [2024-10-31 22:03:54,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU --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 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:03:57,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:03:57,689 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:03:57,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:03:57,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:03:57,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:03:57,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:03:57,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:03:57,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:03:57,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:03:57,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:03:57,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:03:57,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:03:57,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:03:57,740 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:03:57,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:03:57,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:03:57,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:03:57,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:03:57,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:03:57,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:03:57,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:03:57,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:03:57,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:03:57,750 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:03:57,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:03:57,750 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:03:57,750 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:03:57,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:03:57,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:03:57,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:03:57,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:03:57,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:03:57,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:03:57,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:03:57,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:03:57,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:03:57,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:03:57,755 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:03:57,755 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:03:57,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:03:57,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:03:57,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:03:57,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:03:57,758 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:03:57,758 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_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/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_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 207d54556929a93aa39d246b1f9a7e7f3ed779038a85bd758d97838d975fbe31 [2024-10-31 22:03:58,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:03:58,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:03:58,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:03:58,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:03:58,209 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:03:58,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i Unable to find full path for "g++" [2024-10-31 22:04:00,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:04:00,651 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:04:00,652 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i [2024-10-31 22:04:00,662 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/data/fead6d3b2/9c116266488142a5ae9289614ebeed68/FLAG885256e8f [2024-10-31 22:04:00,679 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/data/fead6d3b2/9c116266488142a5ae9289614ebeed68 [2024-10-31 22:04:00,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:04:00,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:04:00,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:00,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:04:00,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:04:00,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5650ade7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:00, skipping insertion in model container [2024-10-31 22:04:00,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:04:00" (1/1) ... [2024-10-31 22:04:00,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:04:00,976 WARN L251 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_9eccfd11-d153-407a-8cf3-6988c2128d9e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i[913,926] [2024-10-31 22:04:01,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:01,069 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:04:01,097 WARN L251 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_9eccfd11-d153-407a-8cf3-6988c2128d9e/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-33.i[913,926] [2024-10-31 22:04:01,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:04:01,204 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:04:01,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01 WrapperNode [2024-10-31 22:04:01,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:04:01,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:01,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:04:01,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:04:01,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,280 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-31 22:04:01,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:04:01,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:04:01,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:04:01,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:04:01,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,335 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]. [2024-10-31 22:04:01,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:04:01,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:04:01,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:04:01,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:04:01,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (1/1) ... [2024-10-31 22:04:01,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:04:01,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:04:01,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:04:01,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:04:01,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:04:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:04:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:04:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:04:01,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:04:01,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:04:01,619 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:04:01,622 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:04:02,744 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-31 22:04:02,744 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:04:02,759 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:04:02,759 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:04:02,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:02 BoogieIcfgContainer [2024-10-31 22:04:02,760 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:04:02,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:04:02,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:04:02,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:04:02,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:04:00" (1/3) ... [2024-10-31 22:04:02,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d73f1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:02, skipping insertion in model container [2024-10-31 22:04:02,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:04:01" (2/3) ... [2024-10-31 22:04:02,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d73f1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:04:02, skipping insertion in model container [2024-10-31 22:04:02,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:04:02" (3/3) ... [2024-10-31 22:04:02,779 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-33.i [2024-10-31 22:04:02,800 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:04:02,801 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:04:02,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:04:02,873 INFO L333 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, 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;@568ec063, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:04:02,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:04:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-31 22:04:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-31 22:04:02,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:02,889 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:02,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:02,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:02,896 INFO L85 PathProgramCache]: Analyzing trace with hash -222403520, now seen corresponding path program 1 times [2024-10-31 22:04:02,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:04:02,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123686064] [2024-10-31 22:04:02,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:02,919 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 [2024-10-31 22:04:02,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:04:02,920 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/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) [2024-10-31 22:04:02,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:04:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:03,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:04:03,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:04:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-31 22:04:03,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:04:03,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:04:03,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123686064] [2024-10-31 22:04:03,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123686064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:03,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:04:03,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:04:03,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753676219] [2024-10-31 22:04:03,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:03,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:04:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:04:03,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:04:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:04:03,260 INFO L87 Difference]: Start difference. First operand has 41 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-31 22:04:03,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:04:03,292 INFO L93 Difference]: Finished difference Result 75 states and 117 transitions. [2024-10-31 22:04:03,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:04:03,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-10-31 22:04:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:04:03,306 INFO L225 Difference]: With dead ends: 75 [2024-10-31 22:04:03,306 INFO L226 Difference]: Without dead ends: 37 [2024-10-31 22:04:03,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:04:03,318 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:04:03,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:04:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-31 22:04:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-31 22:04:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-31 22:04:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-10-31 22:04:03,382 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 66 [2024-10-31 22:04:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:04:03,384 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-10-31 22:04:03,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-31 22:04:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-10-31 22:04:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-31 22:04:03,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:04:03,389 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:04:03,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/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)] Ended with exit code 0 [2024-10-31 22:04:03,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:04:03,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:04:03,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:04:03,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1057703046, now seen corresponding path program 1 times [2024-10-31 22:04:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:04:03,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94618948] [2024-10-31 22:04:03,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:03,602 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 [2024-10-31 22:04:03,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:04:03,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/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) [2024-10-31 22:04:03,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/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 [2024-10-31 22:04:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:03,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-31 22:04:03,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:04:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-31 22:04:04,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:04:05,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:04:05,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94618948] [2024-10-31 22:04:05,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94618948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:04:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1023680285] [2024-10-31 22:04:05,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:04:05,115 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-31 22:04:05,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 [2024-10-31 22:04:05,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-31 22:04:05,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9eccfd11-d153-407a-8cf3-6988c2128d9e/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-31 22:04:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:04:05,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-31 22:04:05,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:04:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-31 22:04:05,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:04:05,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1023680285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:04:05,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 22:04:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-31 22:04:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885706393] [2024-10-31 22:04:05,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:04:05,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:04:05,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:04:05,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:04:05,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:04:05,913 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9)