./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:31:42,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:31:42,443 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:31:42,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:31:42,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:31:42,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:31:42,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:31:42,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:31:42,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:31:42,492 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:31:42,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:31:42,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:31:42,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:31:42,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:31:42,495 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:31:42,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:31:42,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:31:42,495 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:31:42,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:31:42,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:31:42,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:31:42,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:31:42,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:31:42,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:31:42,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:31:42,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:31:42,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:31:42,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:31:42,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:31:42,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:31:42,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:31:42,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:31:42,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:31:42,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:31:42,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:31:42,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:31:42,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:31:42,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:31:42,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:31:42,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:31:42,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:31:42,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:31:42,508 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a [2024-10-13 06:31:42,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:31:42,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:31:42,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:31:42,853 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:31:42,853 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:31:42,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i [2024-10-13 06:31:44,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:31:44,704 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:31:44,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i [2024-10-13 06:31:44,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac598937/d51af1963c524dd3bba8b5bd972e013c/FLAGec228762e [2024-10-13 06:31:45,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ac598937/d51af1963c524dd3bba8b5bd972e013c [2024-10-13 06:31:45,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:31:45,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:31:45,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:31:45,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:31:45,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:31:45,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e519b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45, skipping insertion in model container [2024-10-13 06:31:45,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:31:45,248 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i[916,929] [2024-10-13 06:31:45,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:31:45,341 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:31:45,356 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i[916,929] [2024-10-13 06:31:45,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:31:45,431 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:31:45,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45 WrapperNode [2024-10-13 06:31:45,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:31:45,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:31:45,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:31:45,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:31:45,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,498 INFO L138 Inliner]: procedures = 29, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 534 [2024-10-13 06:31:45,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:31:45,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:31:45,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:31:45,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:31:45,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,564 INFO L175 MemorySlicer]: Split 138 memory accesses to 2 slices as follows [2, 136]. 99 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 17]. The 18 writes are split as follows [0, 18]. [2024-10-13 06:31:45,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:31:45,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:31:45,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:31:45,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:31:45,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (1/1) ... [2024-10-13 06:31:45,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:31:45,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:31:45,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:31:45,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:31:45,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:31:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:31:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:31:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:31:45,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:31:45,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:31:45,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:31:45,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:31:45,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:31:45,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:31:45,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:31:45,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:31:45,701 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:31:45,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:31:45,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:31:45,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:31:45,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:31:45,823 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:31:45,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:31:46,413 INFO L? ?]: Removed 139 outVars from TransFormulas that were not future-live. [2024-10-13 06:31:46,414 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:31:46,453 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:31:46,453 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:31:46,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:31:46 BoogieIcfgContainer [2024-10-13 06:31:46,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:31:46,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:31:46,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:31:46,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:31:46,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:31:45" (1/3) ... [2024-10-13 06:31:46,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5e1c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:31:46, skipping insertion in model container [2024-10-13 06:31:46,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:45" (2/3) ... [2024-10-13 06:31:46,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5e1c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:31:46, skipping insertion in model container [2024-10-13 06:31:46,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:31:46" (3/3) ... [2024-10-13 06:31:46,472 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-72.i [2024-10-13 06:31:46,496 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:31:46,497 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:31:46,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:31:46,589 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;@46651f85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:31:46,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:31:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 102 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:31:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:31:46,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:46,614 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:31:46,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:46,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:46,622 INFO L85 PathProgramCache]: Analyzing trace with hash -881856283, now seen corresponding path program 1 times [2024-10-13 06:31:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:46,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965398177] [2024-10-13 06:31:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:31:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:31:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:31:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:31:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:31:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:31:47,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:47,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965398177] [2024-10-13 06:31:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965398177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:47,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:47,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:31:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241029670] [2024-10-13 06:31:47,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:47,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:31:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:31:47,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:31:47,240 INFO L87 Difference]: Start difference. First operand has 121 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 102 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:31:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:47,305 INFO L93 Difference]: Finished difference Result 239 states and 375 transitions. [2024-10-13 06:31:47,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:31:47,310 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2024-10-13 06:31:47,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:47,318 INFO L225 Difference]: With dead ends: 239 [2024-10-13 06:31:47,318 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 06:31:47,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:31:47,328 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:47,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:31:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 06:31:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-13 06:31:47,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:31:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2024-10-13 06:31:47,376 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 144 [2024-10-13 06:31:47,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:47,379 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2024-10-13 06:31:47,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:31:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2024-10-13 06:31:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:31:47,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:47,383 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:31:47,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:31:47,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:47,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2029423183, now seen corresponding path program 1 times [2024-10-13 06:31:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671907580] [2024-10-13 06:31:47,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:31:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:31:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:31:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:31:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:31:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:31:48,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:48,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671907580] [2024-10-13 06:31:48,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671907580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:48,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:48,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:31:48,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975037131] [2024-10-13 06:31:48,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:48,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:31:48,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:48,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:31:48,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:48,056 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:31:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:48,118 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-10-13 06:31:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:31:48,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2024-10-13 06:31:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:48,122 INFO L225 Difference]: With dead ends: 239 [2024-10-13 06:31:48,122 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 06:31:48,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:48,124 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:48,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:31:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 06:31:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-13 06:31:48,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:31:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-10-13 06:31:48,151 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 144 [2024-10-13 06:31:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:48,152 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-10-13 06:31:48,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:31:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-10-13 06:31:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:31:48,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:48,155 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:31:48,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:31:48,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:48,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1957780412, now seen corresponding path program 1 times [2024-10-13 06:31:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:48,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979754779] [2024-10-13 06:31:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:48,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:31:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:31:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:31:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:31:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:31:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:31:48,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:48,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979754779] [2024-10-13 06:31:48,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979754779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:48,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:48,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:31:48,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321107213] [2024-10-13 06:31:48,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:48,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:31:48,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:48,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:31:48,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:48,480 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:31:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:48,539 INFO L93 Difference]: Finished difference Result 244 states and 357 transitions. [2024-10-13 06:31:48,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:31:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-13 06:31:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:48,550 INFO L225 Difference]: With dead ends: 244 [2024-10-13 06:31:48,550 INFO L226 Difference]: Without dead ends: 124 [2024-10-13 06:31:48,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:48,552 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:48,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 497 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:31:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-13 06:31:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-10-13 06:31:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 104 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:31:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 179 transitions. [2024-10-13 06:31:48,573 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 179 transitions. Word has length 146 [2024-10-13 06:31:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:48,574 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 179 transitions. [2024-10-13 06:31:48,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:31:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 179 transitions. [2024-10-13 06:31:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:31:48,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:48,579 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:31:48,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:31:48,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:48,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:48,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1527840258, now seen corresponding path program 1 times [2024-10-13 06:31:48,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:48,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866092641] [2024-10-13 06:31:48,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:48,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:31:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:31:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:31:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:31:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:31:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:31:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866092641] [2024-10-13 06:31:48,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866092641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:48,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:48,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:31:48,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511893508] [2024-10-13 06:31:48,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:48,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:31:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:48,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:31:48,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:48,882 INFO L87 Difference]: Start difference. First operand 123 states and 179 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:31:48,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:48,934 INFO L93 Difference]: Finished difference Result 248 states and 361 transitions. [2024-10-13 06:31:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:31:48,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-13 06:31:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:48,940 INFO L225 Difference]: With dead ends: 248 [2024-10-13 06:31:48,943 INFO L226 Difference]: Without dead ends: 126 [2024-10-13 06:31:48,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:48,945 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:48,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 498 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:31:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-13 06:31:48,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2024-10-13 06:31:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:31:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2024-10-13 06:31:48,966 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 146 [2024-10-13 06:31:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:48,967 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2024-10-13 06:31:48,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:31:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2024-10-13 06:31:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:31:48,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:48,972 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:31:48,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:31:48,972 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:48,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1585098560, now seen corresponding path program 1 times [2024-10-13 06:31:48,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:48,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117286060] [2024-10-13 06:31:48,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:48,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:31:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:31:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:31:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:31:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:31:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:31:49,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:49,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117286060] [2024-10-13 06:31:49,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117286060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:49,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:49,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:31:49,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190324231] [2024-10-13 06:31:49,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:49,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:31:49,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:49,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:31:49,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:49,207 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:31:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:49,247 INFO L93 Difference]: Finished difference Result 252 states and 365 transitions. [2024-10-13 06:31:49,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:31:49,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-13 06:31:49,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:49,251 INFO L225 Difference]: With dead ends: 252 [2024-10-13 06:31:49,251 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 06:31:49,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:49,258 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:49,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 501 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:31:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 06:31:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-10-13 06:31:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:31:49,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2024-10-13 06:31:49,274 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 146 [2024-10-13 06:31:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:49,274 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2024-10-13 06:31:49,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:31:49,275 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2024-10-13 06:31:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:31:49,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:49,279 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:31:49,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:31:49,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:49,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:49,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1585158142, now seen corresponding path program 1 times [2024-10-13 06:31:49,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:49,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727676163] [2024-10-13 06:31:49,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:49,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:31:49,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:31:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:31:49,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:31:49,580 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:31:49,581 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:31:49,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:31:49,586 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 06:31:49,668 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:31:49,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:31:49 BoogieIcfgContainer [2024-10-13 06:31:49,673 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:31:49,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:31:49,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:31:49,674 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:31:49,675 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:31:46" (3/4) ... [2024-10-13 06:31:49,677 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:31:49,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:31:49,679 INFO L158 Benchmark]: Toolchain (without parser) took 4643.86ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 102.4MB in the beginning and 63.8MB in the end (delta: 38.6MB). Peak memory consumption was 96.7MB. Max. memory is 16.1GB. [2024-10-13 06:31:49,679 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:31:49,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.64ms. Allocated memory is still 157.3MB. Free memory was 102.4MB in the beginning and 83.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 06:31:49,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.55ms. Allocated memory is still 157.3MB. Free memory was 83.5MB in the beginning and 79.8MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:31:49,680 INFO L158 Benchmark]: Boogie Preprocessor took 104.44ms. Allocated memory is still 157.3MB. Free memory was 79.8MB in the beginning and 74.7MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 06:31:49,681 INFO L158 Benchmark]: RCFGBuilder took 847.18ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 74.7MB in the beginning and 159.9MB in the end (delta: -85.2MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2024-10-13 06:31:49,681 INFO L158 Benchmark]: TraceAbstraction took 3216.55ms. Allocated memory is still 213.9MB. Free memory was 158.8MB in the beginning and 64.9MB in the end (delta: 94.0MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2024-10-13 06:31:49,681 INFO L158 Benchmark]: Witness Printer took 4.70ms. Allocated memory is still 213.9MB. Free memory was 64.9MB in the beginning and 63.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:31:49,683 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.17ms. Allocated memory is still 157.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.64ms. Allocated memory is still 157.3MB. Free memory was 102.4MB in the beginning and 83.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.55ms. Allocated memory is still 157.3MB. Free memory was 83.5MB in the beginning and 79.8MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.44ms. Allocated memory is still 157.3MB. Free memory was 79.8MB in the beginning and 74.7MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 847.18ms. Allocated memory was 157.3MB in the beginning and 213.9MB in the end (delta: 56.6MB). Free memory was 74.7MB in the beginning and 159.9MB in the end (delta: -85.2MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3216.55ms. Allocated memory is still 213.9MB. Free memory was 158.8MB in the beginning and 64.9MB in the end (delta: 94.0MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. * Witness Printer took 4.70ms. Allocated memory is still 213.9MB. Free memory was 64.9MB in the beginning and 63.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 1, 0, 2, -16, -2, -10, 4, 256.4, 0.25, 100000000000.2, 50.5, 9.5, 100000000000.4, 4, 10000 }; [L61] unsigned char last_1_WrapperStruct00_var_1_1 = 1; [L62] double last_1_WrapperStruct00_var_1_15 = 256.4; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_1 [L114] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L115] EXPR WrapperStruct00.var_1_15 [L115] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L85] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L86] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L87] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L88] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L90] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L91] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L93] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L94] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L95] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L96] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L97] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L99] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L100] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L102] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L103] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L104] EXPR WrapperStruct00.var_1_16 [L104] EXPR WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] EXPR WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_16 [L104] EXPR WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L105] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_16 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_16 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L106] WrapperStruct00.var_1_17 = __VERIFIER_nondet_double() [L107] EXPR WrapperStruct00.var_1_17 [L107] EXPR WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] EXPR WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_17 [L107] EXPR WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] EXPR (WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] EXPR (WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_17 >= 0.0F && WrapperStruct00.var_1_17 <= -1.0e-20F) || (WrapperStruct00.var_1_17 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_17 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L108] WrapperStruct00.var_1_18 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_18 [L109] EXPR WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] EXPR WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_18 [L109] EXPR WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] EXPR (WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] EXPR (WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= 0.0F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L110] WrapperStruct00.var_1_19 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_19 [L111] EXPR WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] EXPR WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_19 [L111] EXPR WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] EXPR (WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] EXPR (WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_19 >= 0.0F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L126] RET updateVariables() [L127] CALL step() [L66] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L66] COND FALSE !(WrapperStruct00.var_1_9) [L69] EXPR WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_13 [L69] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L69] EXPR (((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)) [L69] EXPR WrapperStruct00.var_1_12 [L69] EXPR WrapperStruct00.var_1_13 [L69] EXPR (((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L69] WrapperStruct00.var_1_11 = (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)))) [L70] EXPR WrapperStruct00.var_1_19 [L70] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_19 [L71] WrapperStruct00.var_1_21 = 1 [L72] WrapperStruct00.var_1_22 = 10 [L73] EXPR WrapperStruct00.var_1_20 [L73] EXPR WrapperStruct00.var_1_20 [L73] EXPR WrapperStruct00.var_1_16 [L73] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L73] COND FALSE !((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) [L80] EXPR WrapperStruct00.var_1_20 [L80] EXPR WrapperStruct00.var_1_15 [L80] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L80] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L80] EXPR WrapperStruct00.var_1_15 [L80] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L80] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L80] COND FALSE !(WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_20 [L118] EXPR WrapperStruct00.var_1_15 [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L118] EXPR WrapperStruct00.var_1_15 [L118] EXPR ((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1 [L118] EXPR WrapperStruct00.var_1_1 [L118] EXPR WrapperStruct00.var_1_6 [L118] EXPR WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR ((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1))) && (WrapperStruct00.var_1_22 == ((unsigned short int) 10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118] EXPR (((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1))) && (WrapperStruct00.var_1_22 == ((unsigned short int) 10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L118-L119] return (((((((WrapperStruct00.var_1_20 < (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) * WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 && ((last_1_WrapperStruct00_var_1_1 || WrapperStruct00.var_1_8) && WrapperStruct00.var_1_9)))) : 1) && (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_10 == ((unsigned long int) 2u)) : 1)) && (WrapperStruct00.var_1_11 == ((signed char) (((((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) < ((10 - WrapperStruct00.var_1_14))) ? ((WrapperStruct00.var_1_12 + WrapperStruct00.var_1_13)) : ((10 - WrapperStruct00.var_1_14))))))) && (((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_20 / WrapperStruct00.var_1_16)) == WrapperStruct00.var_1_20) ? ((WrapperStruct00.var_1_20 >= last_1_WrapperStruct00_var_1_15) ? (WrapperStruct00.var_1_15 == ((double) (WrapperStruct00.var_1_17 - (((((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) < (9.9999999999995E12)) ? ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_19)) : (9.9999999999995E12)))))) : (WrapperStruct00.var_1_15 == ((double) ((((WrapperStruct00.var_1_17) < ((5.75 + WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17) : ((5.75 + WrapperStruct00.var_1_19))))))) : 1)) && (WrapperStruct00.var_1_20 == ((double) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_21 == ((signed char) 1))) && (WrapperStruct00.var_1_22 == ((unsigned short int) 10)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=1282/5, last_1_WrapperStruct00_var_1_1=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 121 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2167 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1322 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 845 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 721 ConstructedInterpolants, 0 QuantifiedInterpolants, 730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2720/2720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 06:31:49,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:31:52,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:31:52,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:31:52,280 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:31:52,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:31:52,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:31:52,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:31:52,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:31:52,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:31:52,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:31:52,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:31:52,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:31:52,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:31:52,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:31:52,329 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:31:52,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:31:52,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:31:52,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:31:52,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:31:52,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:31:52,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:31:52,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:31:52,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:31:52,335 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:31:52,335 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:31:52,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:31:52,336 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:31:52,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:31:52,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:31:52,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:31:52,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:31:52,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:31:52,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:31:52,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:31:52,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:31:52,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:31:52,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:31:52,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:31:52,339 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:31:52,339 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:31:52,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:31:52,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:31:52,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:31:52,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:31:52,340 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:31:52,340 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 8a6b1e16ae829d5686c91b3f759f297edb0ae10a608027b90b675b6283e6173a [2024-10-13 06:31:52,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:31:52,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:31:52,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:31:52,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:31:52,733 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:31:52,737 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i [2024-10-13 06:31:54,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:31:54,712 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:31:54,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i [2024-10-13 06:31:54,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad13bb07/d1780cf0b73b417cb74717de243558d0/FLAGafb23a711 [2024-10-13 06:31:54,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad13bb07/d1780cf0b73b417cb74717de243558d0 [2024-10-13 06:31:54,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:31:54,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:31:54,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:31:54,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:31:54,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:31:54,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:31:54" (1/1) ... [2024-10-13 06:31:54,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae74cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:54, skipping insertion in model container [2024-10-13 06:31:54,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:31:54" (1/1) ... [2024-10-13 06:31:54,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:31:55,024 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i[916,929] [2024-10-13 06:31:55,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:31:55,141 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:31:55,153 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-72.i[916,929] [2024-10-13 06:31:55,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:31:55,254 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:31:55,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55 WrapperNode [2024-10-13 06:31:55,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:31:55,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:31:55,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:31:55,256 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:31:55,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,348 INFO L138 Inliner]: procedures = 39, calls = 167, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 531 [2024-10-13 06:31:55,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:31:55,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:31:55,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:31:55,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:31:55,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,419 INFO L175 MemorySlicer]: Split 138 memory accesses to 2 slices as follows [2, 136]. 99 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 17]. The 18 writes are split as follows [0, 18]. [2024-10-13 06:31:55,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:31:55,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:31:55,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:31:55,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:31:55,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (1/1) ... [2024-10-13 06:31:55,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:31:55,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:31:55,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:31:55,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:31:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:31:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:31:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:31:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:31:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:31:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:31:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:31:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:31:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:31:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:31:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:31:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:31:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:31:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:31:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:31:55,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:31:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:31:55,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:31:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:31:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:31:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:31:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:31:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:31:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:31:55,807 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:31:55,809 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:32:28,070 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2024-10-13 06:32:28,071 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:32:28,123 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:32:28,124 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:32:28,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:32:28 BoogieIcfgContainer [2024-10-13 06:32:28,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:32:28,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:32:28,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:32:28,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:32:28,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:31:54" (1/3) ... [2024-10-13 06:32:28,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a61f422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:32:28, skipping insertion in model container [2024-10-13 06:32:28,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:55" (2/3) ... [2024-10-13 06:32:28,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a61f422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:32:28, skipping insertion in model container [2024-10-13 06:32:28,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:32:28" (3/3) ... [2024-10-13 06:32:28,141 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-72.i [2024-10-13 06:32:28,155 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:32:28,155 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:32:28,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:32:28,232 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;@9d0dd36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:32:28,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:32:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 102 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:32:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:32:28,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:28,253 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:28,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:28,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash -881856283, now seen corresponding path program 1 times [2024-10-13 06:32:28,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:28,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719273923] [2024-10-13 06:32:28,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:28,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:28,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:28,283 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:32:28,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 06:32:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:29,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:32:29,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-10-13 06:32:29,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:29,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719273923] [2024-10-13 06:32:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719273923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:32:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503090580] [2024-10-13 06:32:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:29,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:32:29,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:29,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:32:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:32:29,861 INFO L87 Difference]: Start difference. First operand has 121 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 102 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:32:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:29,986 INFO L93 Difference]: Finished difference Result 239 states and 375 transitions. [2024-10-13 06:32:29,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:32:29,990 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2024-10-13 06:32:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:30,000 INFO L225 Difference]: With dead ends: 239 [2024-10-13 06:32:30,001 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 06:32:30,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:32:30,011 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:30,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:32:30,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 06:32:30,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-13 06:32:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:32:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2024-10-13 06:32:30,077 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 144 [2024-10-13 06:32:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:30,079 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2024-10-13 06:32:30,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:32:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2024-10-13 06:32:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:32:30,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:30,085 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:30,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 06:32:30,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:30,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:30,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2029423183, now seen corresponding path program 1 times [2024-10-13 06:32:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:30,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153659768] [2024-10-13 06:32:30,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:30,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:30,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:30,291 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:32:30,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 06:32:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:31,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:32:31,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:32:31,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:31,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:31,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153659768] [2024-10-13 06:32:31,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153659768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:31,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:31,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:32:31,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802845434] [2024-10-13 06:32:31,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:31,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:32:31,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:31,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:32:31,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:31,914 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:32:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:32,666 INFO L93 Difference]: Finished difference Result 239 states and 352 transitions. [2024-10-13 06:32:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:32:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2024-10-13 06:32:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:32,669 INFO L225 Difference]: With dead ends: 239 [2024-10-13 06:32:32,670 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 06:32:32,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:32:32,672 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:32,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 500 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:32:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 06:32:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-13 06:32:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:32:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 177 transitions. [2024-10-13 06:32:32,686 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 177 transitions. Word has length 144 [2024-10-13 06:32:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:32,688 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 177 transitions. [2024-10-13 06:32:32,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:32:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 177 transitions. [2024-10-13 06:32:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:32:32,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:32,691 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:32,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 06:32:32,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:32,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:32,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1957780412, now seen corresponding path program 1 times [2024-10-13 06:32:32,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:32,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132969203] [2024-10-13 06:32:32,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:32,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:32,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:32,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:32:32,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 06:32:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:34,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:32:34,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:32:34,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:34,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132969203] [2024-10-13 06:32:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132969203] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:34,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:32:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492174706] [2024-10-13 06:32:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:34,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:32:34,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:34,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:32:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:34,776 INFO L87 Difference]: Start difference. First operand 121 states and 177 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:32:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:35,743 INFO L93 Difference]: Finished difference Result 248 states and 363 transitions. [2024-10-13 06:32:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:32:35,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-13 06:32:35,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:35,749 INFO L225 Difference]: With dead ends: 248 [2024-10-13 06:32:35,750 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 06:32:35,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:35,751 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:35,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 807 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:32:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 06:32:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-10-13 06:32:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 108 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:32:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2024-10-13 06:32:35,774 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 146 [2024-10-13 06:32:35,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:35,775 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2024-10-13 06:32:35,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:32:35,776 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2024-10-13 06:32:35,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:32:35,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:35,778 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:35,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 06:32:35,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:35,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:35,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:35,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1527840258, now seen corresponding path program 1 times [2024-10-13 06:32:35,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:35,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099990601] [2024-10-13 06:32:35,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:35,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:35,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:35,990 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:32:35,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 06:32:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:37,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:32:37,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:32:38,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:38,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:38,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099990601] [2024-10-13 06:32:38,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099990601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:38,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:38,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:32:38,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903075954] [2024-10-13 06:32:38,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:38,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:32:38,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:38,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:32:38,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:32:38,118 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:32:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:39,386 INFO L93 Difference]: Finished difference Result 256 states and 369 transitions. [2024-10-13 06:32:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:32:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-13 06:32:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:39,389 INFO L225 Difference]: With dead ends: 256 [2024-10-13 06:32:39,389 INFO L226 Difference]: Without dead ends: 130 [2024-10-13 06:32:39,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:32:39,391 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:39,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 957 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 06:32:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-13 06:32:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2024-10-13 06:32:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 110 states have internal predecessors, (151), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:32:39,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 185 transitions. [2024-10-13 06:32:39,401 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 185 transitions. Word has length 146 [2024-10-13 06:32:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:39,401 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 185 transitions. [2024-10-13 06:32:39,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:32:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 185 transitions. [2024-10-13 06:32:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:32:39,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:39,405 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:39,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 06:32:39,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:39,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:39,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:39,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1585098560, now seen corresponding path program 1 times [2024-10-13 06:32:39,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:39,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296577610] [2024-10-13 06:32:39,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:39,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:39,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:39,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:32:39,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 06:32:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:40,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 06:32:40,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-13 06:32:41,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:41,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:41,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296577610] [2024-10-13 06:32:41,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296577610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:41,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:41,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:32:41,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408581326] [2024-10-13 06:32:41,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:41,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:32:41,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:41,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:32:41,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:32:41,788 INFO L87 Difference]: Start difference. First operand 129 states and 185 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:32:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:43,430 INFO L93 Difference]: Finished difference Result 260 states and 373 transitions. [2024-10-13 06:32:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:32:43,432 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 146 [2024-10-13 06:32:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:43,434 INFO L225 Difference]: With dead ends: 260 [2024-10-13 06:32:43,434 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 06:32:43,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:32:43,435 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:43,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1110 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 06:32:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 06:32:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2024-10-13 06:32:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 112 states have internal predecessors, (153), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-13 06:32:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 187 transitions. [2024-10-13 06:32:43,454 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 187 transitions. Word has length 146 [2024-10-13 06:32:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:43,455 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 187 transitions. [2024-10-13 06:32:43,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-13 06:32:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 187 transitions. [2024-10-13 06:32:43,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-13 06:32:43,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:43,457 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:32:43,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 06:32:43,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:43,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:43,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1585158142, now seen corresponding path program 1 times [2024-10-13 06:32:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:32:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861085107] [2024-10-13 06:32:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:43,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:32:43,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:32:43,669 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:32:43,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 06:32:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:44,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:32:44,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:32:47,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:32:47,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-10-13 06:32:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-10-13 06:32:47,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:32:47,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:32:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861085107] [2024-10-13 06:32:47,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861085107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:47,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:47,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:32:47,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232733000] [2024-10-13 06:32:47,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:47,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:32:47,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:32:47,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:32:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:32:47,755 INFO L87 Difference]: Start difference. First operand 131 states and 187 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-13 06:32:54,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 06:32:58,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:02,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:06,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:10,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:33:14,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []