./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_5.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/combinations/gcd_4+newton_3_5.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 0c562931a6d05e325b28cce00e946abdf58c2b9fa526927c821e1aeeb79c8db9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:39:23,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:39:23,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:39:23,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:39:23,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:39:23,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:39:23,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:39:23,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:39:23,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:39:23,583 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:39:23,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:39:23,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:39:23,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:39:23,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:39:23,587 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:39:23,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:39:23,588 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:39:23,588 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:39:23,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:39:23,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:39:23,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:39:23,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:39:23,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:39:23,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:39:23,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:39:23,594 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:39:23,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:39:23,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:39:23,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:39:23,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:39:23,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:39:23,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:39:23,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:39:23,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:39:23,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:39:23,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:39:23,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:39:23,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:39:23,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:39:23,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:39:23,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:39:23,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:39:23,601 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 -> 0c562931a6d05e325b28cce00e946abdf58c2b9fa526927c821e1aeeb79c8db9 [2024-10-11 04:39:23,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:39:23,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:39:23,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:39:23,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:39:23,863 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:39:23,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_5.i [2024-10-11 04:39:25,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:39:25,534 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:39:25,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_5.i [2024-10-11 04:39:25,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f28c81ce5/47d9a45522054abc84dd2b28b8aaee12/FLAGcaf58bfb4 [2024-10-11 04:39:25,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f28c81ce5/47d9a45522054abc84dd2b28b8aaee12 [2024-10-11 04:39:25,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:39:25,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:39:25,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:39:25,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:39:25,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:39:25,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e1b51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25, skipping insertion in model container [2024-10-11 04:39:25,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:39:25,761 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/combinations/gcd_4+newton_3_5.i[1224,1237] [2024-10-11 04:39:25,795 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/combinations/gcd_4+newton_3_5.i[2848,2861] [2024-10-11 04:39:25,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:39:25,811 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:39:25,842 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/combinations/gcd_4+newton_3_5.i[1224,1237] [2024-10-11 04:39:25,851 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/combinations/gcd_4+newton_3_5.i[2848,2861] [2024-10-11 04:39:25,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:39:25,878 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:39:25,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25 WrapperNode [2024-10-11 04:39:25,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:39:25,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:39:25,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:39:25,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:39:25,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,908 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 84 [2024-10-11 04:39:25,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:39:25,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:39:25,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:39:25,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:39:25,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,942 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-11 04:39:25,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:39:25,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:39:25,957 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:39:25,957 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:39:25,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (1/1) ... [2024-10-11 04:39:25,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:39:25,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:39:25,994 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 04:39:25,996 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 04:39:26,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:39:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-10-11 04:39:26,048 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-10-11 04:39:26,048 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-11 04:39:26,050 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-11 04:39:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:39:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 04:39:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:39:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:39:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 04:39:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 04:39:26,133 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:39:26,135 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:39:26,336 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 04:39:26,337 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:39:26,380 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:39:26,381 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 04:39:26,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:26 BoogieIcfgContainer [2024-10-11 04:39:26,381 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:39:26,383 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:39:26,383 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:39:26,387 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:39:26,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:39:25" (1/3) ... [2024-10-11 04:39:26,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5341443b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:39:26, skipping insertion in model container [2024-10-11 04:39:26,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:25" (2/3) ... [2024-10-11 04:39:26,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5341443b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:39:26, skipping insertion in model container [2024-10-11 04:39:26,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:26" (3/3) ... [2024-10-11 04:39:26,392 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_5.i [2024-10-11 04:39:26,411 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:39:26,412 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:39:26,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:39:26,505 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;@3608907f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:39:26,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:39:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 27 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 04:39:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 04:39:26,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:39:26,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:39:26,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:39:26,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:39:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash -843708153, now seen corresponding path program 1 times [2024-10-11 04:39:26,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:39:26,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431067153] [2024-10-11 04:39:26,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:39:26,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:39:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:39:26,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:39:26,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:39:26,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431067153] [2024-10-11 04:39:26,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431067153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:39:26,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:39:26,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:39:26,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168063485] [2024-10-11 04:39:26,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:39:26,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:39:26,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:39:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:39:26,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:39:26,927 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 27 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:39:27,054 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2024-10-11 04:39:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:39:27,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 04:39:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:39:27,065 INFO L225 Difference]: With dead ends: 79 [2024-10-11 04:39:27,066 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 04:39:27,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:39:27,074 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:39:27,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:39:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 04:39:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-10-11 04:39:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 04:39:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-11 04:39:27,138 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 10 [2024-10-11 04:39:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:39:27,140 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-11 04:39:27,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-11 04:39:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 04:39:27,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:39:27,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:39:27,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:39:27,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:39:27,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:39:27,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1380841513, now seen corresponding path program 1 times [2024-10-11 04:39:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:39:27,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065910239] [2024-10-11 04:39:27,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:39:27,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:39:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:39:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:39:27,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:39:27,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065910239] [2024-10-11 04:39:27,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065910239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:39:27,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:39:27,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:39:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133717182] [2024-10-11 04:39:27,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:39:27,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:39:27,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:39:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:39:27,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:39:27,283 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:39:27,323 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-10-11 04:39:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:39:27,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 04:39:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:39:27,326 INFO L225 Difference]: With dead ends: 52 [2024-10-11 04:39:27,326 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 04:39:27,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:39:27,328 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:39:27,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:39:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 04:39:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 04:39:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 04:39:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-10-11 04:39:27,342 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 12 [2024-10-11 04:39:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:39:27,343 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-10-11 04:39:27,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-10-11 04:39:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 04:39:27,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:39:27,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:39:27,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:39:27,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:39:27,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:39:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash 289454548, now seen corresponding path program 1 times [2024-10-11 04:39:27,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:39:27,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854315773] [2024-10-11 04:39:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:39:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:39:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:39:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:39:27,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:39:27,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854315773] [2024-10-11 04:39:27,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854315773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:39:27,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:39:27,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:39:27,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829790000] [2024-10-11 04:39:27,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:39:27,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:39:27,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:39:27,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:39:27,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:39:27,490 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:39:27,531 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-10-11 04:39:27,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:39:27,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 04:39:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:39:27,533 INFO L225 Difference]: With dead ends: 53 [2024-10-11 04:39:27,534 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 04:39:27,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:39:27,537 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:39:27,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:39:27,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 04:39:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-11 04:39:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 04:39:27,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-11 04:39:27,552 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 14 [2024-10-11 04:39:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:39:27,552 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-11 04:39:27,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:27,553 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-10-11 04:39:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 04:39:27,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:39:27,554 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:39:27,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:39:27,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:39:27,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:39:27,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1181837103, now seen corresponding path program 1 times [2024-10-11 04:39:27,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:39:27,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885580869] [2024-10-11 04:39:27,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:39:27,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:39:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:39:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:39:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:39:27,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885580869] [2024-10-11 04:39:27,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885580869] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:39:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438635267] [2024-10-11 04:39:27,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:39:27,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:39:27,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:39:27,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:39:27,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:39:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:39:27,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 04:39:27,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:39:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:39:27,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:39:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:39:27,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438635267] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:39:27,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:39:27,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-10-11 04:39:27,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759836063] [2024-10-11 04:39:27,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:39:27,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 04:39:27,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:39:27,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 04:39:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:39:27,993 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:39:28,079 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2024-10-11 04:39:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 04:39:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 04:39:28,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:39:28,081 INFO L225 Difference]: With dead ends: 57 [2024-10-11 04:39:28,081 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 04:39:28,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 04:39:28,083 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:39:28,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:39:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 04:39:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 04:39:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 04:39:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2024-10-11 04:39:28,096 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 16 [2024-10-11 04:39:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:39:28,096 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2024-10-11 04:39:28,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2024-10-11 04:39:28,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 04:39:28,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:39:28,098 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:39:28,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:39:28,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:39:28,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:39:28,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:39:28,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2047032053, now seen corresponding path program 2 times [2024-10-11 04:39:28,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:39:28,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625409288] [2024-10-11 04:39:28,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:39:28,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:39:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:39:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:39:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:39:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625409288] [2024-10-11 04:39:28,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625409288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:39:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196006017] [2024-10-11 04:39:28,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 04:39:28,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:39:28,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:39:28,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:39:28,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:39:28,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 04:39:28,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 04:39:28,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 04:39:28,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:39:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:39:28,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:39:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:39:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196006017] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:39:28,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 04:39:28,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-10-11 04:39:28,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543720877] [2024-10-11 04:39:28,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 04:39:28,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 04:39:28,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:39:28,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 04:39:28,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:39:28,738 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:39:28,924 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2024-10-11 04:39:28,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 04:39:28,925 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 04:39:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:39:28,926 INFO L225 Difference]: With dead ends: 65 [2024-10-11 04:39:28,926 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 04:39:28,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2024-10-11 04:39:28,927 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 04:39:28,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 185 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 04:39:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 04:39:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 04:39:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 38 states have internal predecessors, (42), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 04:39:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2024-10-11 04:39:28,935 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 20 [2024-10-11 04:39:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:39:28,935 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2024-10-11 04:39:28,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-10-11 04:39:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 04:39:28,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:39:28,937 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:39:28,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 04:39:29,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:39:29,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:39:29,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:39:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2091413279, now seen corresponding path program 1 times [2024-10-11 04:39:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:39:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81165321] [2024-10-11 04:39:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:39:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:39:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 04:39:29,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 04:39:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 04:39:29,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 04:39:29,177 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 04:39:29,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-11 04:39:29,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-11 04:39:29,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:39:29,184 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-10-11 04:39:29,207 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 04:39:29,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 04:39:29 BoogieIcfgContainer [2024-10-11 04:39:29,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 04:39:29,211 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 04:39:29,211 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 04:39:29,211 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 04:39:29,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:26" (3/4) ... [2024-10-11 04:39:29,214 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 04:39:29,216 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 04:39:29,216 INFO L158 Benchmark]: Toolchain (without parser) took 3660.31ms. Allocated memory was 159.4MB in the beginning and 197.1MB in the end (delta: 37.7MB). Free memory was 86.8MB in the beginning and 151.0MB in the end (delta: -64.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 04:39:29,217 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory was 112.0MB in the beginning and 111.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 04:39:29,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.56ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 130.9MB in the end (delta: -44.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-11 04:39:29,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.82ms. Allocated memory is still 159.4MB. Free memory was 130.9MB in the beginning and 129.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 04:39:29,217 INFO L158 Benchmark]: Boogie Preprocessor took 46.82ms. Allocated memory is still 159.4MB. Free memory was 129.7MB in the beginning and 127.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 04:39:29,217 INFO L158 Benchmark]: RCFGBuilder took 424.75ms. Allocated memory is still 159.4MB. Free memory was 127.6MB in the beginning and 111.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 04:39:29,218 INFO L158 Benchmark]: TraceAbstraction took 2826.61ms. Allocated memory was 159.4MB in the beginning and 197.1MB in the end (delta: 37.7MB). Free memory was 110.8MB in the beginning and 151.0MB in the end (delta: -40.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 04:39:29,218 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 197.1MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 04:39:29,219 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 159.4MB. Free memory was 112.0MB in the beginning and 111.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.56ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 130.9MB in the end (delta: -44.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.82ms. Allocated memory is still 159.4MB. Free memory was 130.9MB in the beginning and 129.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.82ms. Allocated memory is still 159.4MB. Free memory was 129.7MB in the beginning and 127.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 424.75ms. Allocated memory is still 159.4MB. Free memory was 127.6MB in the beginning and 111.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2826.61ms. Allocated memory was 159.4MB in the beginning and 197.1MB in the end (delta: 37.7MB). Free memory was 110.8MB in the beginning and 151.0MB in the end (delta: -40.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 197.1MB. Free memory is still 151.0MB. 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: 109]: 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 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 104. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -1.0f && IN < 1.0f) [L82] COND FALSE !(!cond) [L98] RET assume_abort_if_not(IN > -1.0f && IN < 1.0f) [L100] CALL, EXPR f(IN) VAL [\old(x)=111] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L100] RET, EXPR f(IN) VAL [IN=111] [L100] CALL, EXPR fp(IN) VAL [\old(x)=111] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L100] RET, EXPR fp(IN) VAL [IN=111] [L100] float x = IN - f(IN)/fp(IN); [L102] CALL, EXPR f(x) VAL [\old(x)=112] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L102] RET, EXPR f(x) VAL [IN=111, x=112] [L102] CALL, EXPR fp(x) VAL [\old(x)=112] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L102] RET, EXPR fp(x) VAL [IN=111, x=112] [L102] x = x - f(x)/fp(x) [L104] CALL, EXPR f(x) VAL [\old(x)=110] [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; [L104] RET, EXPR f(x) VAL [IN=111, x=110] [L104] CALL, EXPR fp(x) VAL [\old(x)=110] [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; [L104] RET, EXPR fp(x) VAL [IN=111, x=110] [L104] x = x - f(x)/fp(x) [L108] COND TRUE !(x < 0.1) VAL [IN=111] [L109] reach_error() VAL [IN=111] - UnprovableResult [Line: 27]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 605 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 427 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 178 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 504 SizeOfPredicates, 5 NumberOfNonLiveVariables, 168 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 29/61 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 04:39:29,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/combinations/gcd_4+newton_3_5.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 0c562931a6d05e325b28cce00e946abdf58c2b9fa526927c821e1aeeb79c8db9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:39:31,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:39:31,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 04:39:31,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:39:31,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:39:31,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:39:31,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:39:31,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:39:31,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:39:31,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:39:31,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:39:31,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:39:31,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:39:31,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:39:31,628 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:39:31,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:39:31,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:39:31,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:39:31,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:39:31,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:39:31,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:39:31,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:39:31,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:39:31,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 04:39:31,634 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 04:39:31,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:39:31,635 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 04:39:31,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:39:31,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:39:31,635 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:39:31,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:39:31,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:39:31,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:39:31,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:39:31,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:39:31,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:39:31,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:39:31,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:39:31,640 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 04:39:31,640 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 04:39:31,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:39:31,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:39:31,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:39:31,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:39:31,641 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 04:39:31,642 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 -> 0c562931a6d05e325b28cce00e946abdf58c2b9fa526927c821e1aeeb79c8db9 [2024-10-11 04:39:31,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:39:32,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:39:32,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:39:32,026 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:39:32,026 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:39:32,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_5.i [2024-10-11 04:39:33,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:39:33,681 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:39:33,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_3_5.i [2024-10-11 04:39:33,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7bf64e531/c93a3b35fcd74648be23b1451cebaa45/FLAGf8a0aa5ef [2024-10-11 04:39:33,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7bf64e531/c93a3b35fcd74648be23b1451cebaa45 [2024-10-11 04:39:33,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:39:33,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:39:33,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:39:33,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:39:33,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:39:33,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:39:33" (1/1) ... [2024-10-11 04:39:33,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@662bcece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:33, skipping insertion in model container [2024-10-11 04:39:33,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:39:33" (1/1) ... [2024-10-11 04:39:33,745 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:39:33,967 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/combinations/gcd_4+newton_3_5.i[1224,1237] [2024-10-11 04:39:34,007 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/combinations/gcd_4+newton_3_5.i[2848,2861] [2024-10-11 04:39:34,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:39:34,025 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:39:34,038 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/combinations/gcd_4+newton_3_5.i[1224,1237] [2024-10-11 04:39:34,058 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/combinations/gcd_4+newton_3_5.i[2848,2861] [2024-10-11 04:39:34,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:39:34,081 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:39:34,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34 WrapperNode [2024-10-11 04:39:34,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:39:34,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:39:34,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:39:34,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:39:34,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,128 INFO L138 Inliner]: procedures = 28, calls = 28, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2024-10-11 04:39:34,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:39:34,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:39:34,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:39:34,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:39:34,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,170 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-11 04:39:34,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:39:34,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:39:34,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:39:34,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:39:34,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (1/1) ... [2024-10-11 04:39:34,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:39:34,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:39:34,225 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 04:39:34,233 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 04:39:34,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:39:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 04:39:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 04:39:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-10-11 04:39:34,278 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-10-11 04:39:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-10-11 04:39:34,278 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-10-11 04:39:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:39:34,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:39:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 04:39:34,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 04:39:34,371 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:39:34,374 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:39:46,665 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 04:39:46,666 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:39:46,698 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:39:46,699 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 04:39:46,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:46 BoogieIcfgContainer [2024-10-11 04:39:46,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:39:46,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:39:46,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:39:46,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:39:46,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:39:33" (1/3) ... [2024-10-11 04:39:46,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3bd372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:39:46, skipping insertion in model container [2024-10-11 04:39:46,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:39:34" (2/3) ... [2024-10-11 04:39:46,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3bd372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:39:46, skipping insertion in model container [2024-10-11 04:39:46,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:39:46" (3/3) ... [2024-10-11 04:39:46,710 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_3_5.i [2024-10-11 04:39:46,726 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:39:46,727 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:39:46,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:39:46,804 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;@737f22be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:39:46,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:39:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 27 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 04:39:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 04:39:46,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:39:46,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:39:46,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:39:46,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:39:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash -843708153, now seen corresponding path program 1 times [2024-10-11 04:39:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 04:39:46,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569855589] [2024-10-11 04:39:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:39:46,836 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 04:39:46,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 04:39:46,839 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 04:39:46,840 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 04:39:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:39:46,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 04:39:46,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:39:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:39:47,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:39:47,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 04:39:47,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569855589] [2024-10-11 04:39:47,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569855589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:39:47,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:39:47,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:39:47,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901174166] [2024-10-11 04:39:47,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:39:47,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:39:47,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 04:39:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:39:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:39:47,088 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 27 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:39:51,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:39:55,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:39:59,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:03,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:03,853 INFO L93 Difference]: Finished difference Result 79 states and 112 transitions. [2024-10-11 04:40:03,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:03,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 04:40:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:03,863 INFO L225 Difference]: With dead ends: 79 [2024-10-11 04:40:03,863 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 04:40:03,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:03,869 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:03,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 16.7s Time] [2024-10-11 04:40:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 04:40:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-10-11 04:40:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 24 states have internal predecessors, (27), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 04:40:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-11 04:40:03,903 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 10 [2024-10-11 04:40:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:03,903 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-11 04:40:03,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:40:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-11 04:40:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 04:40:03,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:03,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:40:03,913 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 04:40:04,106 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 04:40:04,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:04,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1380841513, now seen corresponding path program 1 times [2024-10-11 04:40:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 04:40:04,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347766687] [2024-10-11 04:40:04,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:04,108 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 04:40:04,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 04:40:04,111 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 04:40:04,113 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 04:40:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:04,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 04:40:04,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:04,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:04,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:40:04,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 04:40:04,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347766687] [2024-10-11 04:40:04,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347766687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:04,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:04,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:04,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175992432] [2024-10-11 04:40:04,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:04,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 04:40:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:04,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:04,311 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:40:08,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:12,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:16,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:16,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:16,791 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-10-11 04:40:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:16,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 04:40:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:16,792 INFO L225 Difference]: With dead ends: 52 [2024-10-11 04:40:16,792 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 04:40:16,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:16,795 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:16,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time] [2024-10-11 04:40:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 04:40:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 04:40:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 04:40:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-10-11 04:40:16,804 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 12 [2024-10-11 04:40:16,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:16,804 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-10-11 04:40:16,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:40:16,805 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-10-11 04:40:16,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 04:40:16,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:16,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:40:16,813 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 04:40:17,006 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 04:40:17,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:17,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash 289454548, now seen corresponding path program 1 times [2024-10-11 04:40:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 04:40:17,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738507562] [2024-10-11 04:40:17,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:17,009 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 04:40:17,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 04:40:17,012 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 04:40:17,014 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 04:40:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:17,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 04:40:17,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:17,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:40:17,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 04:40:17,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738507562] [2024-10-11 04:40:17,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738507562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:40:17,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:40:17,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 04:40:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383835718] [2024-10-11 04:40:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:40:17,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:40:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 04:40:17,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:40:17,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:17,485 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:40:21,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:25,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:30,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:34,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:40:34,300 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-10-11 04:40:34,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:40:34,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 04:40:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:40:34,301 INFO L225 Difference]: With dead ends: 53 [2024-10-11 04:40:34,302 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 04:40:34,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 04:40:34,303 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:40:34,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 4 Unknown, 0 Unchecked, 16.8s Time] [2024-10-11 04:40:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 04:40:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-11 04:40:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 04:40:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-10-11 04:40:34,310 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 14 [2024-10-11 04:40:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:40:34,311 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-10-11 04:40:34,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:40:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-10-11 04:40:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 04:40:34,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:40:34,312 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:40:34,320 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 (4)] Ended with exit code 0 [2024-10-11 04:40:34,512 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 04:40:34,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:40:34,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:40:34,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1181837103, now seen corresponding path program 1 times [2024-10-11 04:40:34,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 04:40:34,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915666156] [2024-10-11 04:40:34,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:40:34,514 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 04:40:34,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 04:40:34,517 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 04:40:34,518 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 04:40:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:40:34,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 04:40:34,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:40:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:35,229 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 04:40:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:40:35,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 04:40:35,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915666156] [2024-10-11 04:40:35,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915666156] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 04:40:35,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 04:40:35,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-11 04:40:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429437860] [2024-10-11 04:40:35,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 04:40:35,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:40:35,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 04:40:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:40:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:40:35,626 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 04:40:40,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:44,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:48,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:52,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:40:56,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:41:00,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 04:41:04,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []