./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-45.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX --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 234ea2f8e3d6d6484515d1c4ef9cb5f5cd5e6bfd33069cc1d7dd92768b55f593 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:17:30,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:17:30,092 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:17:30,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:17:30,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:17:30,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:17:30,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:17:30,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:17:30,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:17:30,125 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:17:30,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:17:30,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:17:30,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:17:30,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:17:30,127 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:17:30,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:17:30,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:17:30,131 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:17:30,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:17:30,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:17:30,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:17:30,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:17:30,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:17:30,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:17:30,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:17:30,137 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:17:30,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:17:30,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:17:30,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:17:30,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:17:30,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:17:30,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:17:30,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:17:30,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:17:30,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:17:30,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:17:30,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:17:30,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:17:30,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:17:30,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:17:30,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:17:30,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:17:30,148 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_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/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_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX 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 -> 234ea2f8e3d6d6484515d1c4ef9cb5f5cd5e6bfd33069cc1d7dd92768b55f593 [2024-11-08 17:17:30,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:17:30,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:17:30,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:17:30,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:17:30,481 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:17:30,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-45.i Unable to find full path for "g++" [2024-11-08 17:17:32,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:17:32,669 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:17:32,670 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-45.i [2024-11-08 17:17:32,685 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/data/87fdc93e3/622f05e05f734fe4b203d7df3b388b3e/FLAG8842f9a08 [2024-11-08 17:17:33,037 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/data/87fdc93e3/622f05e05f734fe4b203d7df3b388b3e [2024-11-08 17:17:33,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:17:33,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:17:33,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:17:33,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:17:33,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:17:33,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f24e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33, skipping insertion in model container [2024-11-08 17:17:33,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:17:33,262 WARN L250 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_ec678386-0e01-4556-beb0-47e2c15078af/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-45.i[915,928] [2024-11-08 17:17:33,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:17:33,333 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:17:33,345 WARN L250 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_ec678386-0e01-4556-beb0-47e2c15078af/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-45.i[915,928] [2024-11-08 17:17:33,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:17:33,406 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:17:33,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33 WrapperNode [2024-11-08 17:17:33,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:17:33,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:17:33,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:17:33,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:17:33,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,455 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-08 17:17:33,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:17:33,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:17:33,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:17:33,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:17:33,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,488 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-11-08 17:17:33,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:17:33,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:17:33,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:17:33,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:17:33,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (1/1) ... [2024-11-08 17:17:33,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:17:33,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:17:33,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:17:33,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:17:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:17:33,586 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:17:33,587 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:17:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:17:33,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:17:33,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:17:33,690 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:17:33,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:17:34,023 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 17:17:34,023 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:17:34,037 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:17:34,038 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 17:17:34,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:17:34 BoogieIcfgContainer [2024-11-08 17:17:34,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:17:34,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:17:34,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:17:34,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:17:34,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:17:33" (1/3) ... [2024-11-08 17:17:34,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607ec6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:17:34, skipping insertion in model container [2024-11-08 17:17:34,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:17:33" (2/3) ... [2024-11-08 17:17:34,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607ec6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:17:34, skipping insertion in model container [2024-11-08 17:17:34,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:17:34" (3/3) ... [2024-11-08 17:17:34,048 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-45.i [2024-11-08 17:17:34,067 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:17:34,067 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:17:34,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:17:34,142 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;@2ef7109a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:17:34,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:17:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:17:34,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 17:17:34,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:34,160 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:17:34,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:34,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash 16306666, now seen corresponding path program 1 times [2024-11-08 17:17:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896119472] [2024-11-08 17:17:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:34,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 17:17:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:17:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:17:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:17:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:17:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:17:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:17:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:17:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:17:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 17:17:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 17:17:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:17:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 17:17:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:17:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:17:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:17:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:17:34,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:34,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896119472] [2024-11-08 17:17:34,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896119472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:34,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:34,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:17:34,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306677] [2024-11-08 17:17:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:34,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:17:34,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:34,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:17:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:17:34,684 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 17:17:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:34,720 INFO L93 Difference]: Finished difference Result 113 states and 185 transitions. [2024-11-08 17:17:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:17:34,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2024-11-08 17:17:34,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:34,734 INFO L225 Difference]: With dead ends: 113 [2024-11-08 17:17:34,734 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 17:17:34,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-11-08 17:17:34,744 INFO L432 NwaCegarLoop]: 84 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, 84 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-11-08 17:17:34,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:17:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 17:17:34,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-08 17:17:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 17:17:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2024-11-08 17:17:34,799 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 108 [2024-11-08 17:17:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:34,802 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 79 transitions. [2024-11-08 17:17:34,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 17:17:34,802 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 79 transitions. [2024-11-08 17:17:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 17:17:34,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:34,806 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:17:34,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:17:34,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:34,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:34,808 INFO L85 PathProgramCache]: Analyzing trace with hash 472773098, now seen corresponding path program 1 times [2024-11-08 17:17:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:34,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723209938] [2024-11-08 17:17:34,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 17:17:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:17:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:17:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:17:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:17:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:17:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:17:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:17:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:17:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 17:17:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 17:17:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:17:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 17:17:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:17:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:17:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:17:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:17:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:17:35,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:17:35,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723209938] [2024-11-08 17:17:35,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723209938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:17:35,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:17:35,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:17:35,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157491261] [2024-11-08 17:17:35,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:17:35,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:17:35,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:17:35,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:17:35,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:17:35,216 INFO L87 Difference]: Start difference. First operand 54 states and 79 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:17:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:17:35,310 INFO L93 Difference]: Finished difference Result 153 states and 225 transitions. [2024-11-08 17:17:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:17:35,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-11-08 17:17:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:17:35,316 INFO L225 Difference]: With dead ends: 153 [2024-11-08 17:17:35,316 INFO L226 Difference]: Without dead ends: 102 [2024-11-08 17:17:35,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-11-08 17:17:35,321 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 68 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:17:35,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 151 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:17:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-08 17:17:35,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-11-08 17:17:35,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 65 states have internal predecessors, (81), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 17:17:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2024-11-08 17:17:35,353 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 108 [2024-11-08 17:17:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:17:35,354 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2024-11-08 17:17:35,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:17:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2024-11-08 17:17:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:17:35,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:17:35,356 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:17:35,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:17:35,357 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:17:35,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:17:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1181573544, now seen corresponding path program 1 times [2024-11-08 17:17:35,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:17:35,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595901815] [2024-11-08 17:17:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:17:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:17:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 17:21:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:21:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:21:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:21:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:21:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:21:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:21:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:21:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:21:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 17:21:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 17:21:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:21:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 17:21:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:21:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:21:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:21:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:21:00,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:21:00,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595901815] [2024-11-08 17:21:00,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595901815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:21:00,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:21:00,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:21:00,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742475032] [2024-11-08 17:21:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:21:00,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:21:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:21:00,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:21:00,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:21:00,350 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:21:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:21:05,572 INFO L93 Difference]: Finished difference Result 373 states and 505 transitions. [2024-11-08 17:21:05,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:21:05,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-11-08 17:21:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:21:05,577 INFO L225 Difference]: With dead ends: 373 [2024-11-08 17:21:05,577 INFO L226 Difference]: Without dead ends: 276 [2024-11-08 17:21:05,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:21:05,580 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 198 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:21:05,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 467 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 17:21:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-08 17:21:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 218. [2024-11-08 17:21:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 164 states have (on average 1.2560975609756098) internal successors, (206), 169 states have internal predecessors, (206), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 41 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 17:21:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 298 transitions. [2024-11-08 17:21:05,639 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 298 transitions. Word has length 109 [2024-11-08 17:21:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:21:05,640 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 298 transitions. [2024-11-08 17:21:05,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:21:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 298 transitions. [2024-11-08 17:21:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:21:05,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:21:05,643 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:21:05,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:21:05,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:21:05,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:21:05,644 INFO L85 PathProgramCache]: Analyzing trace with hash 593433818, now seen corresponding path program 1 times [2024-11-08 17:21:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:21:05,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211768610] [2024-11-08 17:21:05,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:05,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:21:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:52,348 WARN L286 SmtUtils]: Spent 13.56s on a formula simplification. DAG size of input: 280 DAG size of output: 208 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:24:43,642 WARN L286 SmtUtils]: Spent 19.38s on a formula simplification. DAG size of input: 282 DAG size of output: 210 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:24:43,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 17:24:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:24:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:24:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:24:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:24:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:24:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:24:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:24:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:24:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 17:24:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 17:24:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:24:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 17:24:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:24:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:24:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:24:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:24:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:24:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:24:43,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211768610] [2024-11-08 17:24:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211768610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:24:43,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:24:43,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:24:43,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715526923] [2024-11-08 17:24:43,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:24:43,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:24:43,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:24:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:24:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:24:43,763 INFO L87 Difference]: Start difference. First operand 218 states and 298 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:24:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:24:54,006 INFO L93 Difference]: Finished difference Result 275 states and 358 transitions. [2024-11-08 17:24:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:24:54,007 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-11-08 17:24:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:24:54,011 INFO L225 Difference]: With dead ends: 275 [2024-11-08 17:24:54,012 INFO L226 Difference]: Without dead ends: 273 [2024-11-08 17:24:54,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:24:54,014 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 183 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:24:54,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 487 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 17:24:54,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-08 17:24:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 216. [2024-11-08 17:24:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 167 states have internal predecessors, (204), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 41 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 17:24:54,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 296 transitions. [2024-11-08 17:24:54,084 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 296 transitions. Word has length 109 [2024-11-08 17:24:54,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:24:54,084 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 296 transitions. [2024-11-08 17:24:54,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:24:54,085 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 296 transitions. [2024-11-08 17:24:54,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:24:54,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:24:54,087 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:24:54,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:24:54,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:24:54,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:24:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1365576016, now seen corresponding path program 1 times [2024-11-08 17:24:54,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:24:54,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126682264] [2024-11-08 17:24:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:24:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:24:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 17:25:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:25:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:25:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:25:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:25:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:25:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:25:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:25:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:25:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 17:25:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 17:25:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:25:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 17:25:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:25:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:25:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:25:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:25:15,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:25:15,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126682264] [2024-11-08 17:25:15,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126682264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:25:15,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:25:15,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:25:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831171491] [2024-11-08 17:25:15,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:25:15,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:25:15,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:25:15,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:25:15,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:25:15,638 INFO L87 Difference]: Start difference. First operand 216 states and 296 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:25:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:25:16,319 INFO L93 Difference]: Finished difference Result 543 states and 728 transitions. [2024-11-08 17:25:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:25:16,324 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-11-08 17:25:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:25:16,327 INFO L225 Difference]: With dead ends: 543 [2024-11-08 17:25:16,328 INFO L226 Difference]: Without dead ends: 339 [2024-11-08 17:25:16,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:25:16,331 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 81 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:25:16,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 229 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:25:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-08 17:25:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 246. [2024-11-08 17:25:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 182 states have (on average 1.2417582417582418) internal successors, (226), 187 states have internal predecessors, (226), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 17:25:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 334 transitions. [2024-11-08 17:25:16,441 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 334 transitions. Word has length 109 [2024-11-08 17:25:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:25:16,442 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 334 transitions. [2024-11-08 17:25:16,442 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:25:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 334 transitions. [2024-11-08 17:25:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:25:16,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:25:16,445 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:25:16,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:25:16,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:25:16,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:25:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash 556229390, now seen corresponding path program 1 times [2024-11-08 17:25:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:25:16,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448152906] [2024-11-08 17:25:16,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:16,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:25:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 17:25:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:25:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:25:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:25:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:25:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:25:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:25:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:25:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:25:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 17:25:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 17:25:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:25:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 17:25:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:25:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:25:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:25:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:25:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:25:19,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:25:19,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448152906] [2024-11-08 17:25:19,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448152906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:25:19,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:25:19,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:25:19,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903691265] [2024-11-08 17:25:19,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:25:19,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:25:19,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:25:19,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:25:19,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:25:19,165 INFO L87 Difference]: Start difference. First operand 246 states and 334 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:25:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:25:19,614 INFO L93 Difference]: Finished difference Result 573 states and 764 transitions. [2024-11-08 17:25:19,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:25:19,615 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-11-08 17:25:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:25:19,619 INFO L225 Difference]: With dead ends: 573 [2024-11-08 17:25:19,620 INFO L226 Difference]: Without dead ends: 339 [2024-11-08 17:25:19,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:25:19,625 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 80 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:25:19,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 270 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:25:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-08 17:25:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 236. [2024-11-08 17:25:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 172 states have (on average 1.2325581395348837) internal successors, (212), 177 states have internal predecessors, (212), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 17:25:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 320 transitions. [2024-11-08 17:25:19,715 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 320 transitions. Word has length 109 [2024-11-08 17:25:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:25:19,716 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 320 transitions. [2024-11-08 17:25:19,716 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:25:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 320 transitions. [2024-11-08 17:25:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:25:19,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:25:19,718 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:25:19,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:25:19,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:25:19,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:25:19,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1833530074, now seen corresponding path program 1 times [2024-11-08 17:25:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:25:19,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535829764] [2024-11-08 17:25:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:25:19,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:25:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:26:56,468 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 249 DAG size of output: 227 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:28:37,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 17:28:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:28:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:28:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 17:28:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 17:28:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:28:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:28:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 17:28:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 17:28:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 17:28:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 17:28:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 17:28:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 17:28:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:28:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:28:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 17:28:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:28:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 17:28:37,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:28:37,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535829764] [2024-11-08 17:28:37,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535829764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:28:37,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:28:37,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 17:28:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623656436] [2024-11-08 17:28:37,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:28:37,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 17:28:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:28:37,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 17:28:37,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:28:37,727 INFO L87 Difference]: Start difference. First operand 236 states and 320 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:28:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:28:43,821 INFO L93 Difference]: Finished difference Result 588 states and 775 transitions. [2024-11-08 17:28:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:28:43,821 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2024-11-08 17:28:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:28:43,824 INFO L225 Difference]: With dead ends: 588 [2024-11-08 17:28:43,824 INFO L226 Difference]: Without dead ends: 364 [2024-11-08 17:28:43,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:28:43,826 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 179 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:28:43,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 475 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 17:28:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-08 17:28:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 301. [2024-11-08 17:28:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 227 states have (on average 1.2290748898678414) internal successors, (279), 234 states have internal predecessors, (279), 60 states have call successors, (60), 13 states have call predecessors, (60), 13 states have return successors, (60), 53 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 17:28:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 399 transitions. [2024-11-08 17:28:43,928 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 399 transitions. Word has length 109 [2024-11-08 17:28:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:28:43,929 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 399 transitions. [2024-11-08 17:28:43,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 17:28:43,929 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 399 transitions. [2024-11-08 17:28:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 17:28:43,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:28:43,931 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:28:43,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:28:43,932 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:28:43,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:28:43,932 INFO L85 PathProgramCache]: Analyzing trace with hash -686429860, now seen corresponding path program 1 times [2024-11-08 17:28:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:28:43,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163741119] [2024-11-08 17:28:43,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:28:43,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:28:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:30:57,917 WARN L286 SmtUtils]: Spent 13.81s on a formula simplification. DAG size of input: 291 DAG size of output: 224 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 17:32:32,431 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-08 17:32:32,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:32:32,432 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.postprocessInterpolant(NestedInterpolantsBuilder.java:449) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.buildPredicates(NestedInterpolantsBuilder.java:392) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:320) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 58 more [2024-11-08 17:32:32,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-08 17:32:32,440 INFO L158 Benchmark]: Toolchain (without parser) took 899395.69ms. Allocated memory was 165.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 130.4MB in the beginning and 946.4MB in the end (delta: -816.1MB). Peak memory consumption was 871.6MB. Max. memory is 16.1GB. [2024-11-08 17:32:32,441 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 111.1MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:32:32,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.14ms. Allocated memory is still 165.7MB. Free memory was 129.9MB in the beginning and 114.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 17:32:32,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.19ms. Allocated memory is still 165.7MB. Free memory was 114.7MB in the beginning and 112.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:32:32,442 INFO L158 Benchmark]: Boogie Preprocessor took 49.03ms. Allocated memory is still 165.7MB. Free memory was 112.0MB in the beginning and 107.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:32:32,442 INFO L158 Benchmark]: RCFGBuilder took 532.71ms. Allocated memory is still 165.7MB. Free memory was 107.8MB in the beginning and 88.4MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 17:32:32,444 INFO L158 Benchmark]: TraceAbstraction took 898398.60ms. Allocated memory was 165.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 87.9MB in the beginning and 946.4MB in the end (delta: -858.5MB). Peak memory consumption was 829.6MB. Max. memory is 16.1GB. [2024-11-08 17:32:32,450 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.25ms. Allocated memory is still 111.1MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.14ms. Allocated memory is still 165.7MB. Free memory was 129.9MB in the beginning and 114.7MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.19ms. Allocated memory is still 165.7MB. Free memory was 114.7MB in the beginning and 112.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.03ms. Allocated memory is still 165.7MB. Free memory was 112.0MB in the beginning and 107.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 532.71ms. Allocated memory is still 165.7MB. Free memory was 107.8MB in the beginning and 88.4MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 898398.60ms. Allocated memory was 165.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 87.9MB in the beginning and 946.4MB in the end (delta: -858.5MB). Peak memory consumption was 829.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ec678386-0e01-4556-beb0-47e2c15078af/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...