./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-29.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f738259e7c2d3662066b95c4aab3281c90ec8887937cabf5a1f2a35c9ff839d0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:46:55,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:46:56,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:46:56,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:46:56,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:46:56,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:46:56,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:46:56,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:46:56,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:46:56,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:46:56,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:46:56,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:46:56,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:46:56,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:46:56,063 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:46:56,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:46:56,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:46:56,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:46:56,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:46:56,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:46:56,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:46:56,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:46:56,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:46:56,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:46:56,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:46:56,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:46:56,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:46:56,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:46:56,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:46:56,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:46:56,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:46:56,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:46:56,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:46:56,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:46:56,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:46:56,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:46:56,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:46:56,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:46:56,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:46:56,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:46:56,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:46:56,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:46:56,074 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-clean/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-clean/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 -> f738259e7c2d3662066b95c4aab3281c90ec8887937cabf5a1f2a35c9ff839d0 [2024-10-11 13:46:56,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:46:56,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:46:56,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:46:56,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:46:56,347 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:46:56,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.i [2024-10-11 13:46:57,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:46:57,955 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:46:57,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.i [2024-10-11 13:46:57,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e6c5ee6d2/00f929ef346e4715bd108c39e8a1d982/FLAGaff85aa05 [2024-10-11 13:46:57,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e6c5ee6d2/00f929ef346e4715bd108c39e8a1d982 [2024-10-11 13:46:57,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:46:57,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:46:57,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:46:57,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:46:57,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:46:57,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:46:57" (1/1) ... [2024-10-11 13:46:57,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d270ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:57, skipping insertion in model container [2024-10-11 13:46:57,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:46:57" (1/1) ... [2024-10-11 13:46:58,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:46:58,191 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-29.i[916,929] [2024-10-11 13:46:58,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:46:58,329 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:46:58,339 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-29.i[916,929] [2024-10-11 13:46:58,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:46:58,389 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:46:58,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58 WrapperNode [2024-10-11 13:46:58,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:46:58,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:46:58,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:46:58,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:46:58,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,455 INFO L138 Inliner]: procedures = 29, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2024-10-11 13:46:58,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:46:58,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:46:58,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:46:58,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:46:58,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,501 INFO L175 MemorySlicer]: Split 108 memory accesses to 2 slices as follows [2, 106]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 12 writes are split as follows [0, 12]. [2024-10-11 13:46:58,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:46:58,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:46:58,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:46:58,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:46:58,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (1/1) ... [2024-10-11 13:46:58,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:46:58,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:46:58,575 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:46:58,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:46:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:46:58,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:46:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:46:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:46:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:46:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:46:58,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:46:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:46:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:46:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:46:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:46:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:46:58,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:46:58,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:46:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:46:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:46:58,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:46:58,755 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:46:58,756 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:46:59,164 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-11 13:46:59,165 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:46:59,193 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:46:59,195 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:46:59,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:46:59 BoogieIcfgContainer [2024-10-11 13:46:59,195 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:46:59,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:46:59,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:46:59,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:46:59,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:46:57" (1/3) ... [2024-10-11 13:46:59,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f97ce9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:46:59, skipping insertion in model container [2024-10-11 13:46:59,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:46:58" (2/3) ... [2024-10-11 13:46:59,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f97ce9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:46:59, skipping insertion in model container [2024-10-11 13:46:59,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:46:59" (3/3) ... [2024-10-11 13:46:59,205 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-29.i [2024-10-11 13:46:59,218 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:46:59,218 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:46:59,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:46:59,282 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;@16f07eec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:46:59,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:46:59,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:46:59,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:46:59,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:46:59,299 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:46:59,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:46:59,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:46:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1146688191, now seen corresponding path program 1 times [2024-10-11 13:46:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:46:59,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019960277] [2024-10-11 13:46:59,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:46:59,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:46:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:59,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:46:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:59,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:46:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:59,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:46:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:46:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:59,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:46:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:59,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:46:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:46:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:46:59,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:46:59,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019960277] [2024-10-11 13:46:59,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019960277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:46:59,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:46:59,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:46:59,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870858016] [2024-10-11 13:46:59,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:46:59,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:46:59,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:46:59,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:46:59,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:46:59,699 INFO L87 Difference]: Start difference. First operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:46:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:46:59,742 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2024-10-11 13:46:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:46:59,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-11 13:46:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:46:59,754 INFO L225 Difference]: With dead ends: 159 [2024-10-11 13:46:59,754 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 13:46:59,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-11 13:46:59,763 INFO L432 NwaCegarLoop]: 111 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, 111 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-11 13:46:59,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:46:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 13:46:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 13:46:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 71 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:46:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-10-11 13:46:59,842 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 68 [2024-10-11 13:46:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:46:59,842 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-10-11 13:46:59,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:46:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-10-11 13:46:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:46:59,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:46:59,848 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:46:59,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:46:59,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:46:59,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:46:59,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1845355401, now seen corresponding path program 1 times [2024-10-11 13:46:59,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:46:59,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535175052] [2024-10-11 13:46:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:46:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:46:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:47:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:47:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:47:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:47:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:47:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:47:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:47:00,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:47:00,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535175052] [2024-10-11 13:47:00,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535175052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:47:00,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:47:00,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:47:00,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781277449] [2024-10-11 13:47:00,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:47:00,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:47:00,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:47:00,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:47:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:47:00,100 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:47:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:47:00,159 INFO L93 Difference]: Finished difference Result 160 states and 233 transitions. [2024-10-11 13:47:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:47:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:47:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:47:00,164 INFO L225 Difference]: With dead ends: 160 [2024-10-11 13:47:00,165 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 13:47:00,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-11 13:47:00,167 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 317 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-11 13:47:00,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 317 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:47:00,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 13:47:00,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-11 13:47:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:47:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-10-11 13:47:00,183 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 68 [2024-10-11 13:47:00,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:47:00,185 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-10-11 13:47:00,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:47:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-10-11 13:47:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:47:00,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:47:00,189 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:47:00,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:47:00,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:47:00,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:47:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1788097099, now seen corresponding path program 1 times [2024-10-11 13:47:00,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:47:00,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404223686] [2024-10-11 13:47:00,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:47:00,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:47:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:47:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:47:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:47:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:47:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:47:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:47:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:47:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:47:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404223686] [2024-10-11 13:47:00,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404223686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:47:00,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:47:00,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:47:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445691286] [2024-10-11 13:47:00,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:47:00,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:47:00,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:47:00,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:47:00,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:47:00,386 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:47:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:47:00,437 INFO L93 Difference]: Finished difference Result 164 states and 237 transitions. [2024-10-11 13:47:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:47:00,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:47:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:47:00,440 INFO L225 Difference]: With dead ends: 164 [2024-10-11 13:47:00,441 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 13:47:00,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-11 13:47:00,443 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 321 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-11 13:47:00,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 321 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:47:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 13:47:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-10-11 13:47:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:47:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2024-10-11 13:47:00,454 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 68 [2024-10-11 13:47:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:47:00,455 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2024-10-11 13:47:00,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:47:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2024-10-11 13:47:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:47:00,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:47:00,456 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:47:00,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:47:00,457 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:47:00,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:47:00,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1788037517, now seen corresponding path program 1 times [2024-10-11 13:47:00,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:47:00,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940820839] [2024-10-11 13:47:00,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:47:00,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:47:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:47:00,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:47:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:47:00,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:47:00,620 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:47:00,621 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:47:00,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:47:00,626 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 13:47:00,682 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:47:00,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:47:00 BoogieIcfgContainer [2024-10-11 13:47:00,685 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:47:00,688 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:47:00,688 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:47:00,689 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:47:00,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:46:59" (3/4) ... [2024-10-11 13:47:00,691 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:47:00,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:47:00,693 INFO L158 Benchmark]: Toolchain (without parser) took 2709.26ms. Allocated memory is still 155.2MB. Free memory was 98.8MB in the beginning and 104.8MB in the end (delta: -6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:47:00,693 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 91.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:47:00,693 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.86ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 122.1MB in the end (delta: -23.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 13:47:00,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.36ms. Allocated memory is still 155.2MB. Free memory was 122.1MB in the beginning and 118.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:47:00,694 INFO L158 Benchmark]: Boogie Preprocessor took 83.78ms. Allocated memory is still 155.2MB. Free memory was 118.6MB in the beginning and 114.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:47:00,694 INFO L158 Benchmark]: RCFGBuilder took 654.63ms. Allocated memory is still 155.2MB. Free memory was 114.4MB in the beginning and 83.7MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 13:47:00,694 INFO L158 Benchmark]: TraceAbstraction took 1487.18ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 104.8MB in the end (delta: -21.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:47:00,695 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 155.2MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:47:00,699 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.20ms. Allocated memory is still 96.5MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 91.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.86ms. Allocated memory is still 155.2MB. Free memory was 98.5MB in the beginning and 122.1MB in the end (delta: -23.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.36ms. Allocated memory is still 155.2MB. Free memory was 122.1MB in the beginning and 118.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.78ms. Allocated memory is still 155.2MB. Free memory was 118.6MB in the beginning and 114.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 654.63ms. Allocated memory is still 155.2MB. Free memory was 114.4MB in the beginning and 83.7MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1487.18ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 104.8MB in the end (delta: -21.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 155.2MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 59. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 2.5, 9.3, 3.4, 32, 1, 8, 5, 1, 1, 8 }; [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L77] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L78] EXPR WrapperStruct00.var_1_3 [L78] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L78] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L78] EXPR WrapperStruct00.var_1_3 [L78] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L78] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L78] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L78] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L78] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L79] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L80] EXPR WrapperStruct00.var_1_4 [L80] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L80] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L80] EXPR WrapperStruct00.var_1_4 [L80] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L80] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L80] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L80] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L80] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L82] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] RET updateVariables() [L100] CALL step() [L50] EXPR WrapperStruct00.var_1_13 [L50] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_13 [L51] EXPR WrapperStruct00.var_1_11 [L51] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_11 [L52] WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L52] COND TRUE WrapperStruct00.var_1_12 [L53] EXPR WrapperStruct00.var_1_3 [L53] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_3 [L59] EXPR WrapperStruct00.var_1_1 [L59] EXPR WrapperStruct00.var_1_1 [L59] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L59] COND FALSE !((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) [L62] EXPR WrapperStruct00.var_1_14 [L62] WrapperStruct00.var_1_5 = WrapperStruct00.var_1_14 [L64] EXPR WrapperStruct00.var_1_14 [L64] signed long int stepLocal_0 = 5 * WrapperStruct00.var_1_14; [L65] EXPR WrapperStruct00.var_1_3 [L65] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L65] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1) [L65] EXPR WrapperStruct00.var_1_3 [L65] EXPR ((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=1270] [L65] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1] [L65] COND FALSE !(((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) [L72] EXPR WrapperStruct00.var_1_1 [L72] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L72] COND TRUE WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3 [L73] EXPR WrapperStruct00.var_1_11 [L73] WrapperStruct00.var_1_10 = WrapperStruct00.var_1_11 [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1) [L91] EXPR WrapperStruct00.var_1_1 [L91] EXPR WrapperStruct00.var_1_3 [L91] EXPR WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR ((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR ((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR ((((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR ((((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (((((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (((((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1] [L91-L92] return (((((WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((float) WrapperStruct00.var_1_3)) : ((! (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) < 0 ) ? -(WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_3))))) : 1)) && (((WrapperStruct00.var_1_1 + 8.125) > (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_5 == ((unsigned short int) (((((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_5 == ((unsigned short int) WrapperStruct00.var_1_14)))) && ((((((WrapperStruct00.var_1_3) < (WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_1))) == WrapperStruct00.var_1_1) ? ((WrapperStruct00.var_1_14 > (5 * WrapperStruct00.var_1_14)) ? ((WrapperStruct00.var_1_1 < (WrapperStruct00.var_1_1 * 256.5f)) ? (WrapperStruct00.var_1_9 == ((unsigned short int) WrapperStruct00.var_1_14)) : 1) : 1) : 1)) && ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_11)) : 1)) && (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_13))) && (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_11)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 749 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 421 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 328 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 180/180 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-11 13:47:00,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f738259e7c2d3662066b95c4aab3281c90ec8887937cabf5a1f2a35c9ff839d0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:47:02,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:47:03,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:47:03,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:47:03,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:47:03,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:47:03,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:47:03,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:47:03,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:47:03,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:47:03,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:47:03,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:47:03,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:47:03,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:47:03,054 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:47:03,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:47:03,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:47:03,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:47:03,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:47:03,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:47:03,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:47:03,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:47:03,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:47:03,058 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:47:03,058 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:47:03,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:47:03,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:47:03,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:47:03,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:47:03,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:47:03,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:47:03,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:47:03,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:47:03,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:47:03,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:47:03,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:47:03,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:47:03,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:47:03,063 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:47:03,064 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:47:03,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:47:03,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:47:03,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:47:03,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:47:03,065 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:47:03,065 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-clean/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-clean/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 -> f738259e7c2d3662066b95c4aab3281c90ec8887937cabf5a1f2a35c9ff839d0 [2024-10-11 13:47:03,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:47:03,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:47:03,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:47:03,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:47:03,418 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:47:03,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.i [2024-10-11 13:47:04,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:47:05,135 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:47:05,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-29.i [2024-10-11 13:47:05,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/78ba9c3f3/86279a2435194457b30933c871aa0b5c/FLAGcb37d30c6 [2024-10-11 13:47:05,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/78ba9c3f3/86279a2435194457b30933c871aa0b5c [2024-10-11 13:47:05,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:47:05,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:47:05,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:47:05,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:47:05,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:47:05,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:05,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671a5ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05, skipping insertion in model container [2024-10-11 13:47:05,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:05,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:47:05,743 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-29.i[916,929] [2024-10-11 13:47:05,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:47:05,830 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:47:05,845 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-29.i[916,929] [2024-10-11 13:47:05,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:47:05,944 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:47:05,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05 WrapperNode [2024-10-11 13:47:05,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:47:05,946 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:47:05,946 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:47:05,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:47:05,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:05,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,023 INFO L138 Inliner]: procedures = 33, calls = 126, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2024-10-11 13:47:06,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:47:06,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:47:06,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:47:06,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:47:06,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,081 INFO L175 MemorySlicer]: Split 108 memory accesses to 2 slices as follows [2, 106]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 12 writes are split as follows [0, 12]. [2024-10-11 13:47:06,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,110 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:47:06,136 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:47:06,137 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:47:06,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:47:06,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (1/1) ... [2024-10-11 13:47:06,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:47:06,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:47:06,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:47:06,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:47:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:47:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:47:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:47:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:47:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:47:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:47:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:47:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:47:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:47:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:47:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:47:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:47:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:47:06,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:47:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:47:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:47:06,221 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:47:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:47:06,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:47:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:47:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:47:06,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:47:06,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:47:06,331 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:47:06,332 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:47:15,358 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-11 13:47:15,359 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:47:15,402 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:47:15,403 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:47:15,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:47:15 BoogieIcfgContainer [2024-10-11 13:47:15,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:47:15,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:47:15,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:47:15,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:47:15,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:47:05" (1/3) ... [2024-10-11 13:47:15,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481bca66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:47:15, skipping insertion in model container [2024-10-11 13:47:15,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:47:05" (2/3) ... [2024-10-11 13:47:15,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481bca66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:47:15, skipping insertion in model container [2024-10-11 13:47:15,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:47:15" (3/3) ... [2024-10-11 13:47:15,410 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-29.i [2024-10-11 13:47:15,424 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:47:15,424 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:47:15,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:47:15,486 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;@4ba417d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:47:15,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:47:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:47:15,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:47:15,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:47:15,502 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:47:15,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:47:15,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:47:15,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1146688191, now seen corresponding path program 1 times [2024-10-11 13:47:15,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:47:15,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128336522] [2024-10-11 13:47:15,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:47:15,529 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-11 13:47:15,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:47:15,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:47:15,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:47:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:15,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:47:15,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:47:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 13:47:15,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:47:15,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:47:15,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128336522] [2024-10-11 13:47:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128336522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:47:15,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:47:15,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:47:15,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052561814] [2024-10-11 13:47:15,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:47:15,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:47:15,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:47:16,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:47:16,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:47:16,018 INFO L87 Difference]: Start difference. First operand has 81 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:47:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:47:16,083 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2024-10-11 13:47:16,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:47:16,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-11 13:47:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:47:16,102 INFO L225 Difference]: With dead ends: 159 [2024-10-11 13:47:16,102 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 13:47:16,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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-11 13:47:16,111 INFO L432 NwaCegarLoop]: 111 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, 111 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-11 13:47:16,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:47:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 13:47:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 13:47:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 71 states have internal predecessors, (103), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:47:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-10-11 13:47:16,157 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 68 [2024-10-11 13:47:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:47:16,157 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-10-11 13:47:16,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:47:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-10-11 13:47:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:47:16,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:47:16,160 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:47:16,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:47:16,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:47:16,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:47:16,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:47:16,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1845355401, now seen corresponding path program 1 times [2024-10-11 13:47:16,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:47:16,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398818620] [2024-10-11 13:47:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:47:16,364 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-11 13:47:16,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:47:16,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:47:16,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:47:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:16,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:47:16,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:47:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:47:16,842 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:47:16,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:47:16,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398818620] [2024-10-11 13:47:16,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398818620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:47:16,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:47:16,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:47:16,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973236182] [2024-10-11 13:47:16,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:47:16,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:47:16,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:47:16,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:47:16,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:47:16,846 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:47:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:47:17,080 INFO L93 Difference]: Finished difference Result 164 states and 239 transitions. [2024-10-11 13:47:17,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:47:17,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:47:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:47:17,082 INFO L225 Difference]: With dead ends: 164 [2024-10-11 13:47:17,082 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 13:47:17,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:47:17,084 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 507 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:47:17,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 507 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:47:17,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 13:47:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-10-11 13:47:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:47:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-10-11 13:47:17,097 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 68 [2024-10-11 13:47:17,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:47:17,099 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-10-11 13:47:17,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:47:17,100 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-10-11 13:47:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:47:17,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:47:17,103 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:47:17,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:47:17,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:47:17,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:47:17,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:47:17,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1788097099, now seen corresponding path program 1 times [2024-10-11 13:47:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:47:17,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529878193] [2024-10-11 13:47:17,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:47:17,306 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-11 13:47:17,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:47:17,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:47:17,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:47:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:17,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:47:17,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:47:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:47:17,740 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:47:17,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:47:17,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529878193] [2024-10-11 13:47:17,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529878193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:47:17,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:47:17,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:47:17,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422168856] [2024-10-11 13:47:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:47:17,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:47:17,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:47:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:47:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:47:17,743 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:47:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:47:17,989 INFO L93 Difference]: Finished difference Result 172 states and 245 transitions. [2024-10-11 13:47:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:47:17,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:47:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:47:17,991 INFO L225 Difference]: With dead ends: 172 [2024-10-11 13:47:17,991 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 13:47:17,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:47:17,993 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:47:17,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 603 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:47:17,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 13:47:17,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-10-11 13:47:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:47:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 123 transitions. [2024-10-11 13:47:18,001 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 123 transitions. Word has length 68 [2024-10-11 13:47:18,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:47:18,001 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 123 transitions. [2024-10-11 13:47:18,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:47:18,002 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 123 transitions. [2024-10-11 13:47:18,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:47:18,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:47:18,003 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:47:18,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:47:18,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 13:47:18,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:47:18,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:47:18,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1788037517, now seen corresponding path program 1 times [2024-10-11 13:47:18,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:47:18,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375001808] [2024-10-11 13:47:18,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:47:18,206 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-11 13:47:18,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:47:18,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 13:47:18,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:47:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:18,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:47:18,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:47:18,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:47:18,702 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 94 treesize of output 34 [2024-10-11 13:47:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:47:18,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:47:18,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:47:18,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375001808] [2024-10-11 13:47:18,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375001808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:47:18,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:47:18,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:47:18,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883985466] [2024-10-11 13:47:18,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:47:18,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:47:18,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:47:18,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:47:18,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:47:18,865 INFO L87 Difference]: Start difference. First operand 87 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:47:21,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:47:23,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:47:27,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:47:30,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:47:32,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:47:34,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:47:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:47:35,090 INFO L93 Difference]: Finished difference Result 223 states and 314 transitions. [2024-10-11 13:47:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:47:35,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:47:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:47:35,093 INFO L225 Difference]: With dead ends: 223 [2024-10-11 13:47:35,093 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 13:47:35,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:47:35,095 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 56 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:47:35,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 273 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2024-10-11 13:47:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 13:47:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2024-10-11 13:47:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 13:47:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2024-10-11 13:47:35,103 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 68 [2024-10-11 13:47:35,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:47:35,104 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2024-10-11 13:47:35,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:47:35,104 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2024-10-11 13:47:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:47:35,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:47:35,105 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:47:35,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:47:35,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 13:47:35,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:47:35,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:47:35,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1485861425, now seen corresponding path program 1 times [2024-10-11 13:47:35,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:47:35,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761873191] [2024-10-11 13:47:35,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:47:35,308 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-11 13:47:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:47:35,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 13:47:35,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:47:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:47:35,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 13:47:35,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:47:35,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:47:36,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-11 13:47:36,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 44 [2024-10-11 13:47:36,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:47:36,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 90 treesize of output 47 [2024-10-11 13:47:37,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:47:37,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 101 treesize of output 47 [2024-10-11 13:47:37,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:47:37,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 131 treesize of output 74 [2024-10-11 13:47:37,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:47:37,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 69 [2024-10-11 13:47:37,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:47:37,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 62 [2024-10-11 13:47:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 13:47:37,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:47:37,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:47:37,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761873191] [2024-10-11 13:47:37,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761873191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:47:37,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:47:37,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:47:37,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379230682] [2024-10-11 13:47:37,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:47:37,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:47:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:47:37,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:47:37,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:47:37,741 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:47:40,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:47:42,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:47:44,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:47:47,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:47:49,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:47:51,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:47:53,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:47:57,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:48:00,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:48:02,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:48:04,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:48:06,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:48:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:06,758 INFO L93 Difference]: Finished difference Result 334 states and 470 transitions. [2024-10-11 13:48:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:48:06,759 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2024-10-11 13:48:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:06,761 INFO L225 Difference]: With dead ends: 334 [2024-10-11 13:48:06,761 INFO L226 Difference]: Without dead ends: 242 [2024-10-11 13:48:06,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:48:06,763 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 480 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:06,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 370 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 28.6s Time] [2024-10-11 13:48:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-11 13:48:06,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 127. [2024-10-11 13:48:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 111 states have internal predecessors, (153), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:48:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 177 transitions. [2024-10-11 13:48:06,782 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 177 transitions. Word has length 68 [2024-10-11 13:48:06,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:06,783 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 177 transitions. [2024-10-11 13:48:06,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 13:48:06,783 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 177 transitions. [2024-10-11 13:48:06,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:48:06,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:06,786 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:48:06,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:48:06,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 13:48:06,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:06,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:06,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1689281329, now seen corresponding path program 1 times [2024-10-11 13:48:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:48:06,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39846665] [2024-10-11 13:48:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:06,988 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-11 13:48:06,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:48:06,989 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 13:48:06,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:48:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:07,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:48:07,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:48:07,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 26 [2024-10-11 13:48:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:48:07,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:48:07,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:48:07,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39846665] [2024-10-11 13:48:07,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39846665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:07,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:07,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:48:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68704909] [2024-10-11 13:48:07,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:07,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:48:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:48:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:48:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:48:07,398 INFO L87 Difference]: Start difference. First operand 127 states and 177 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:48:09,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:48:13,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:48:15,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:48:18,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:48:21,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:48:25,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:48:26,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:48:28,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:48:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:29,487 INFO L93 Difference]: Finished difference Result 371 states and 517 transitions. [2024-10-11 13:48:29,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:48:29,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2024-10-11 13:48:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:29,492 INFO L225 Difference]: With dead ends: 371 [2024-10-11 13:48:29,493 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 13:48:29,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:48:29,494 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 103 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:29,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 353 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 21.9s Time] [2024-10-11 13:48:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 13:48:29,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 239. [2024-10-11 13:48:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 208 states have (on average 1.3701923076923077) internal successors, (285), 208 states have internal predecessors, (285), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:48:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 333 transitions. [2024-10-11 13:48:29,522 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 333 transitions. Word has length 68 [2024-10-11 13:48:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:29,523 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 333 transitions. [2024-10-11 13:48:29,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 13:48:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 333 transitions. [2024-10-11 13:48:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 13:48:29,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:29,525 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:48:29,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 13:48:29,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-11 13:48:29,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:29,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash 668212975, now seen corresponding path program 1 times [2024-10-11 13:48:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:48:29,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117117213] [2024-10-11 13:48:29,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:29,727 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-11 13:48:29,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:48:29,730 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 13:48:29,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (8)] Waiting until timeout for monitored process [2024-10-11 13:48:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:30,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 13:48:30,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:48:30,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:48:30,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-11 13:48:30,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-11 13:48:30,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-10-11 13:48:31,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 34 [2024-10-11 13:48:31,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2024-10-11 13:48:31,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:31,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 125 treesize of output 56 [2024-10-11 13:48:31,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:48:31,413 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 148 treesize of output 58 [2024-10-11 13:48:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 13:48:31,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:48:31,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:48:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117117213] [2024-10-11 13:48:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117117213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:31,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:48:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467023976] [2024-10-11 13:48:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:31,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:48:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:48:31,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:48:31,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:48:31,567 INFO L87 Difference]: Start difference. First operand 239 states and 333 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)