./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd --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 3cc62b0a7b5ca086e8c61d00992860cd8ca304621a0a6299cced66b64f38849b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:05:09,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:05:09,368 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:05:09,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:05:09,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:05:09,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:05:09,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:05:09,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:05:09,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:05:09,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:05:09,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:05:09,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:05:09,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:05:09,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:05:09,423 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:05:09,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:05:09,423 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:05:09,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:05:09,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:05:09,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:05:09,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:05:09,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:05:09,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:05:09,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:05:09,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:05:09,424 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:05:09,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:05:09,425 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:05:09,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:05:09,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:05:09,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:05:09,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:05:09,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:05:09,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:05:09,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:05:09,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:05:09,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:05:09,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:05:09,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:05:09,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:05:09,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:05:09,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:05:09,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd 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 -> 3cc62b0a7b5ca086e8c61d00992860cd8ca304621a0a6299cced66b64f38849b [2024-11-13 14:05:09,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:05:09,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:05:09,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:05:09,738 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:05:09,739 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:05:09,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i Unable to find full path for "g++" [2024-11-13 14:05:11,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:05:11,916 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:05:11,916 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i [2024-11-13 14:05:11,935 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/data/34a4a3f91/54d6c42bc72d44b09fb7912dd99f49fa/FLAGb13858e5d [2024-11-13 14:05:11,953 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/data/34a4a3f91/54d6c42bc72d44b09fb7912dd99f49fa [2024-11-13 14:05:11,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:05:11,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:05:11,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:05:11,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:05:11,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:05:11,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:05:11" (1/1) ... [2024-11-13 14:05:11,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a203221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:11, skipping insertion in model container [2024-11-13 14:05:11,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:05:11" (1/1) ... [2024-11-13 14:05:11,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:05:12,152 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_9cb04d52-e875-4d05-a269-df55762425e7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i[915,928] [2024-11-13 14:05:12,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:05:12,221 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:05:12,233 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_9cb04d52-e875-4d05-a269-df55762425e7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-14.i[915,928] [2024-11-13 14:05:12,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:05:12,287 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:05:12,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12 WrapperNode [2024-11-13 14:05:12,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:05:12,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:05:12,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:05:12,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:05:12,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,345 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-13 14:05:12,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:05:12,346 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:05:12,346 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:05:12,346 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:05:12,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,388 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-13 14:05:12,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,392 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:05:12,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:05:12,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:05:12,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:05:12,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (1/1) ... [2024-11-13 14:05:12,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:05:12,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:05:12,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:05:12,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:05:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:05:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:05:12,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:05:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:05:12,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:05:12,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:05:12,569 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:05:12,572 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:05:12,894 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-13 14:05:12,894 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:05:12,911 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:05:12,911 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:05:12,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:05:12 BoogieIcfgContainer [2024-11-13 14:05:12,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:05:12,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:05:12,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:05:12,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:05:12,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:05:11" (1/3) ... [2024-11-13 14:05:12,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23371dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:05:12, skipping insertion in model container [2024-11-13 14:05:12,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:05:12" (2/3) ... [2024-11-13 14:05:12,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23371dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:05:12, skipping insertion in model container [2024-11-13 14:05:12,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:05:12" (3/3) ... [2024-11-13 14:05:12,923 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-14.i [2024-11-13 14:05:12,940 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:05:12,942 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-14.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:05:13,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:05:13,025 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;@1ebfbe1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:05:13,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:05:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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-13 14:05:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 14:05:13,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:13,045 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] [2024-11-13 14:05:13,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:13,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash -140716847, now seen corresponding path program 1 times [2024-11-13 14:05:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:13,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377560424] [2024-11-13 14:05:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:13,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:05:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:05:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:05:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:05:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:05:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:05:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:05:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:05:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:13,524 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-13 14:05:13,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377560424] [2024-11-13 14:05:13,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377560424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:13,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:13,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:05:13,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867635502] [2024-11-13 14:05:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:13,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:05:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:13,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:05:13,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:05:13,557 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 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 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-13 14:05:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:13,577 INFO L93 Difference]: Finished difference Result 99 states and 161 transitions. [2024-11-13 14:05:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:05:13,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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 104 [2024-11-13 14:05:13,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:13,586 INFO L225 Difference]: With dead ends: 99 [2024-11-13 14:05:13,586 INFO L226 Difference]: Without dead ends: 47 [2024-11-13 14:05:13,589 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-13 14:05:13,592 INFO L432 NwaCegarLoop]: 71 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, 71 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-13 14:05:13,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:05:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-13 14:05:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-13 14:05:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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-13 14:05:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-13 14:05:13,642 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 104 [2024-11-13 14:05:13,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:13,642 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-13 14:05:13,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 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-13 14:05:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-13 14:05:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 14:05:13,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:13,648 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] [2024-11-13 14:05:13,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:05:13,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:13,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:13,649 INFO L85 PathProgramCache]: Analyzing trace with hash 226211025, now seen corresponding path program 1 times [2024-11-13 14:05:13,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:13,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239423232] [2024-11-13 14:05:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:05:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:05:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:05:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:05:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:05:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:05:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:05:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:05:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:14,342 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-13 14:05:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239423232] [2024-11-13 14:05:14,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239423232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:14,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:14,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:05:14,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123049302] [2024-11-13 14:05:14,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:14,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:05:14,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:14,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:05:14,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:05:14,353 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (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-13 14:05:14,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:14,550 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2024-11-13 14:05:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:05:14,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (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 104 [2024-11-13 14:05:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:14,552 INFO L225 Difference]: With dead ends: 146 [2024-11-13 14:05:14,552 INFO L226 Difference]: Without dead ends: 102 [2024-11-13 14:05:14,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:05:14,554 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 63 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:14,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 180 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 14:05:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-13 14:05:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2024-11-13 14:05:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 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-13 14:05:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-13 14:05:14,574 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 104 [2024-11-13 14:05:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:14,575 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-13 14:05:14,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (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-13 14:05:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-13 14:05:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 14:05:14,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:14,577 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] [2024-11-13 14:05:14,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:05:14,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:14,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:14,578 INFO L85 PathProgramCache]: Analyzing trace with hash 927275603, now seen corresponding path program 1 times [2024-11-13 14:05:14,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:14,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872178445] [2024-11-13 14:05:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:14,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:05:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:05:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:05:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:05:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:05:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:05:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:05:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:05:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:19,603 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-13 14:05:19,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:19,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872178445] [2024-11-13 14:05:19,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872178445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:19,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:19,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:05:19,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741717090] [2024-11-13 14:05:19,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:19,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:05:19,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:05:19,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:05:19,606 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-13 14:05:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:20,633 INFO L93 Difference]: Finished difference Result 99 states and 137 transitions. [2024-11-13 14:05:20,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:05:20,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 104 [2024-11-13 14:05:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:20,635 INFO L225 Difference]: With dead ends: 99 [2024-11-13 14:05:20,635 INFO L226 Difference]: Without dead ends: 97 [2024-11-13 14:05:20,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:05:20,637 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:20,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 251 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:05:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-13 14:05:20,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2024-11-13 14:05:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 57 states have internal predecessors, (67), 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-13 14:05:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-13 14:05:20,652 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 104 [2024-11-13 14:05:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:20,653 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-13 14:05:20,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-13 14:05:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-13 14:05:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 14:05:20,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:20,655 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] [2024-11-13 14:05:20,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:05:20,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:20,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash 929122645, now seen corresponding path program 1 times [2024-11-13 14:05:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:20,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176693079] [2024-11-13 14:05:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:05:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:05:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:05:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:05:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:05:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:05:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:05:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:05:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:20,863 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-13 14:05:20,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:20,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176693079] [2024-11-13 14:05:20,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176693079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:20,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:20,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:05:20,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830095564] [2024-11-13 14:05:20,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:20,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:05:20,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:20,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:05:20,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:05:20,865 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (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-13 14:05:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:21,047 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-13 14:05:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:05:21,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (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 104 [2024-11-13 14:05:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:21,052 INFO L225 Difference]: With dead ends: 222 [2024-11-13 14:05:21,052 INFO L226 Difference]: Without dead ends: 133 [2024-11-13 14:05:21,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:05:21,054 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 47 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:21,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 211 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:05:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-13 14:05:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-13 14:05:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 79 states have internal predecessors, (92), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:05:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2024-11-13 14:05:21,080 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 104 [2024-11-13 14:05:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:21,081 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2024-11-13 14:05:21,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (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-13 14:05:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2024-11-13 14:05:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 14:05:21,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:21,086 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] [2024-11-13 14:05:21,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:05:21,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:21,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1968608415, now seen corresponding path program 1 times [2024-11-13 14:05:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:21,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475555974] [2024-11-13 14:05:21,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:21,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:05:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:05:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:05:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:05:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:05:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:05:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:05:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:05:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:25,786 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-13 14:05:25,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:25,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475555974] [2024-11-13 14:05:25,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475555974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:25,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:25,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-13 14:05:25,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328207803] [2024-11-13 14:05:25,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:25,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:05:25,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:25,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:05:25,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:05:25,788 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-13 14:05:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:27,189 INFO L93 Difference]: Finished difference Result 165 states and 223 transitions. [2024-11-13 14:05:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 14:05:27,189 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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 105 [2024-11-13 14:05:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:27,191 INFO L225 Difference]: With dead ends: 165 [2024-11-13 14:05:27,191 INFO L226 Difference]: Without dead ends: 163 [2024-11-13 14:05:27,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:05:27,192 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 81 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:27,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 330 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:05:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-13 14:05:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2024-11-13 14:05:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 86 states have (on average 1.1627906976744187) internal successors, (100), 86 states have internal predecessors, (100), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:05:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-13 14:05:27,216 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 105 [2024-11-13 14:05:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:27,216 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-13 14:05:27,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 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-13 14:05:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-13 14:05:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-13 14:05:27,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:27,218 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] [2024-11-13 14:05:27,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:05:27,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:27,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:27,219 INFO L85 PathProgramCache]: Analyzing trace with hash 551351519, now seen corresponding path program 1 times [2024-11-13 14:05:27,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:27,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520598613] [2024-11-13 14:05:27,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:27,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:05:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:05:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:05:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:05:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:05:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:05:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:05:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:05:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:30,816 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-13 14:05:30,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:30,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520598613] [2024-11-13 14:05:30,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520598613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:30,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:05:30,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:05:30,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304635482] [2024-11-13 14:05:30,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:30,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:05:30,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:30,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:05:30,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:05:30,818 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-13 14:05:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:31,580 INFO L93 Difference]: Finished difference Result 161 states and 222 transitions. [2024-11-13 14:05:31,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:05:31,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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 105 [2024-11-13 14:05:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:31,582 INFO L225 Difference]: With dead ends: 161 [2024-11-13 14:05:31,583 INFO L226 Difference]: Without dead ends: 159 [2024-11-13 14:05:31,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:05:31,584 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 43 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:31,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 321 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:05:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-13 14:05:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2024-11-13 14:05:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 93 states have internal predecessors, (109), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-13 14:05:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-11-13 14:05:31,622 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 105 [2024-11-13 14:05:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:31,623 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-11-13 14:05:31,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 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-13 14:05:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-11-13 14:05:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 14:05:31,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:05:31,633 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:05:31,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:05:31,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:05:31,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:05:31,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1932198384, now seen corresponding path program 1 times [2024-11-13 14:05:31,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:05:31,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496176012] [2024-11-13 14:05:31,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:31,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:05:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:05:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:05:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:05:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:05:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:05:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:05:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:05:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:05:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:05:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:05:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:05:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:05:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:05:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:05:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:05:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 14:05:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-13 14:05:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-13 14:05:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-13 14:05:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-13 14:05:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-13 14:05:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-13 14:05:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-13 14:05:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-13 14:05:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-13 14:05:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-13 14:05:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-13 14:05:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-13 14:05:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-13 14:05:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-13 14:05:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-13 14:05:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-13 14:05:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-13 14:05:31,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:05:31,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496176012] [2024-11-13 14:05:31,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496176012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:05:31,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924209005] [2024-11-13 14:05:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:05:31,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:05:31,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:05:31,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:05:31,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:05:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:05:32,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 14:05:32,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:05:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 1060 proven. 0 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-11-13 14:05:32,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:05:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924209005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:05:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:05:32,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-13 14:05:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861195944] [2024-11-13 14:05:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:05:32,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:05:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:05:32,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:05:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:05:32,174 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-13 14:05:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:05:32,232 INFO L93 Difference]: Finished difference Result 204 states and 283 transitions. [2024-11-13 14:05:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:05:32,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2024-11-13 14:05:32,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:05:32,234 INFO L225 Difference]: With dead ends: 204 [2024-11-13 14:05:32,234 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 14:05:32,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:05:32,236 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:05:32,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 106 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:05:32,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 14:05:32,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 14:05:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 14:05:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 14:05:32,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2024-11-13 14:05:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:05:32,237 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 14:05:32,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-13 14:05:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 14:05:32,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 14:05:32,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:05:32,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:05:32,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:05:32,444 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:05:32,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 14:05:33,326 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:05:33,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:05:33 BoogieIcfgContainer [2024-11-13 14:05:33,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:05:33,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:05:33,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:05:33,363 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:05:33,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:05:12" (3/4) ... [2024-11-13 14:05:33,366 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 14:05:33,371 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-13 14:05:33,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-13 14:05:33,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 14:05:33,379 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 14:05:33,380 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 14:05:33,477 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:05:33,478 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 14:05:33,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:05:33,479 INFO L158 Benchmark]: Toolchain (without parser) took 21519.69ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 93.7MB in the beginning and 160.1MB in the end (delta: -66.4MB). Peak memory consumption was 139.6MB. Max. memory is 16.1GB. [2024-11-13 14:05:33,480 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:05:33,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.95ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 81.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:05:33,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.44ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:05:33,482 INFO L158 Benchmark]: Boogie Preprocessor took 53.58ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:05:33,482 INFO L158 Benchmark]: RCFGBuilder took 512.24ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 62.5MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:05:33,482 INFO L158 Benchmark]: TraceAbstraction took 20447.04ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 62.0MB in the beginning and 163.8MB in the end (delta: -101.8MB). Peak memory consumption was 165.6MB. Max. memory is 16.1GB. [2024-11-13 14:05:33,483 INFO L158 Benchmark]: Witness Printer took 115.69ms. Allocated memory is still 327.2MB. Free memory was 163.8MB in the beginning and 160.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:05:33,485 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.31ms. Allocated memory is still 142.6MB. Free memory is still 79.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.95ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 81.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.44ms. Allocated memory is still 117.4MB. Free memory was 80.9MB in the beginning and 79.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.58ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 512.24ms. Allocated memory is still 117.4MB. Free memory was 77.5MB in the beginning and 62.5MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20447.04ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 62.0MB in the beginning and 163.8MB in the end (delta: -101.8MB). Peak memory consumption was 165.6MB. Max. memory is 16.1GB. * Witness Printer took 115.69ms. Allocated memory is still 327.2MB. Free memory was 163.8MB in the beginning and 160.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 7, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 1470 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1024 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 446 mSDtfsCounter, 634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=6, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 59 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 1038 NumberOfCodeBlocks, 1038 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1030 ConstructedInterpolants, 0 QuantifiedInterpolants, 4606 SizeOfPredicates, 0 NumberOfNonLiveVariables, 461 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 6919/6920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((1 <= k_loop) && (((var_1_5 == last_1_var_1_12) && (last_1_var_1_9 != 0)) || ((last_1_var_1_9 == 0) && (((((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536)) == var_1_5) && (((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536)) <= 32767)) || (((65536 + var_1_5) == ((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536))) && (32768 <= ((((16 + var_1_7) + (var_1_8 * 65535)) >= 0) ? (((16 + var_1_7) + (var_1_8 * 65535)) % 65536) : ((((16 + var_1_7) + (var_1_8 * 65535)) % 65536) + 65536)))))))) || (((((last_1_var_1_9 == 0) && (1000000 <= var_1_1)) && (0 <= k_loop)) && (var_1_9 == 0)) && (((long long) var_1_18 + 999744) <= var_1_1))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((last_1_var_1_9 == 0) && (1000000 <= var_1_1)) && (var_1_9 == 0)) && (((long long) var_1_18 + 999744) <= var_1_1)) Ensures: (((((last_1_var_1_9 == 0) && (1000000 <= var_1_1)) && (var_1_9 == 0)) && (((long long) var_1_18 + 999744) <= var_1_1)) && ((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_5 == \old(var_1_5))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_5 == \old(last_1_var_1_5))) && (last_1_var_1_9 == \old(last_1_var_1_9))) && (last_1_var_1_12 == \old(last_1_var_1_12)))) RESULT: Ultimate proved your program to be correct! [2024-11-13 14:05:33,526 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cb04d52-e875-4d05-a269-df55762425e7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE